会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Reverse-byte indexing
    • 反向字节索引
    • US5956705A
    • 1999-09-21
    • US741076
    • 1996-10-30
    • Larry StevensWei HuangAlexander C. HoJonathan D. KleinDinesh DasBoris Klots
    • Larry StevensWei HuangAlexander C. HoJonathan D. KleinDinesh DasBoris Klots
    • G06F17/30G06F12/30
    • G06F17/30327Y10S707/99932
    • A method and apparatus for inserting sorted data into an indexed table is provided. Two or more nodes are used to insert the data into the indexed table. Before an entry for each inserted row is stored in the index associated with the table, the key values in the index entry are transformed using an operation that affects the order of the key values. For example, the order of the bytes used to represent the key values in the index entry may be reversed. The index entries are stored in the portion of the index that corresponds to the transformed key values. As a result, the entries for consecutive key values will not necessarily be stored in the same portion of the index. Consequently, the nodes will not have to compete for a "hot" portion of an index if the nodes are inserting data with key values that fall into the same approximate range. The inverse of the transformation operation is performed on the transformed key values read from the index before the key values are supplied to the user.
    • 提供了一种将排序数据插入到索引表中的方法和装置。 使用两个或多个节点将数据插入到索引表中。 在每个插入行的条目存储在与表相关联的索引中之前,索引条目中的键值将使用影响键值顺序的操作进行转换。 例如,用于表示索引条目中的键值的字节的顺序可以颠倒。 索引条目存储在与转换的键值对应的索引部分中。 因此,连续键值的条目不一定存储在索引的相同部分。 因此,如果节点插入具有落入相同近似范围的键值的数据,则节点将不必竞争索引的“热”部分。 在将键值提供给用户之前,对从索引读取的变换的键值执行变换操作的逆。
    • 7. 发明授权
    • Managing partitioned cache
    • 管理分区缓存
    • US06470423B1
    • 2002-10-22
    • US10032243
    • 2001-12-21
    • Alexander C. HoAshok JoshiGianfranco PutzoluJuan R. LoaizaGraham WoodWilliam H. Bridge, Jr.
    • Alexander C. HoAshok JoshiGianfranco PutzoluJuan R. LoaizaGraham WoodWilliam H. Bridge, Jr.
    • G06F1200
    • G06F12/121G06F12/0866
    • Described herein are approaches for partitioning a buffer cache for dynamically selecting buffers in the buffer cache to store data items, such as data blocks in a DBMS. The selection is based on data access and/or usage patterns. A buffer cache includes multiple buffer pools. A buffer pool is selected from among the multiple buffer pools to store a data item. The selection of a buffer pool is based on various factors, including the likelihood that storing the data item will produce future cache hits, and properties of buffer pools that vary between the buffer pools. Properties of a buffer pool include not only how the buffer pools are organized, both logically and physically, but also how the buffer pool is managed. Examples of a buffer pool property include buffer pool size, size of a buffer in the buffer pool, and the replacement strategy used for a buffer pool (e.g. LRU).
    • 这里描述了用于分割缓冲器高速缓存用于动态选择缓冲器高速缓存中的缓冲器以存储数据项(诸如DBMS中的数据块)的方法。 该选择是基于数据访问和/或使用模式。 缓冲区缓存包括多个缓冲池。 从多个缓冲池中选择缓冲池以存储数据项。 缓冲池的选择基于各种因素,包括存储数据项的可能性将产生未来的缓存命中,以及在缓冲池之间变化的缓冲池的属性。 缓冲池的属性不仅包括缓冲池在逻辑和物理上的组织方式,还包括缓冲池的管理方式。 缓冲池属性的示例包括缓冲池大小,缓冲池中缓冲区的大小以及用于缓冲池(例如LRU)的替换策略。
    • 8. 发明授权
    • Managing partitioned cache
    • 管理分区缓存
    • US06370619B1
    • 2002-04-09
    • US09102735
    • 1998-06-22
    • Alexander C. HoAshok JoshiGianfranco PutzoluJuan R. LoaizaGraham WoodWilliam H. Bridge, Jr.
    • Alexander C. HoAshok JoshiGianfranco PutzoluJuan R. LoaizaGraham WoodWilliam H. Bridge, Jr.
    • G06F1200
    • G06F12/121G06F12/0866
    • The present invention provides a method and apparatus for partitioning a buffer cache for dynamically mapping data blocks with a particular replacement strategy based on the associated table's access and/or usage patterns. According to the method, a buffer cache in a computer system is managed by dividing the buffer cache into multiple buffer pools. In managing the buffer cache, when a data item is requested, it is first determined whether the requested data item is stored in a buffer within the buffer cache. If the requested data item is not stored in a buffer in the buffer cache, then a particular buffer pool in the buffer cache is dynamically selected for storing the requested data item. Once the particular buffer pool is selected, the requested data item is stored into a buffer in the particular buffer pool.
    • 本发明提供了一种用于分割缓冲器高速缓存的方法和装置,用于基于相关联的表的访问和/或使用模式,用特定替换策略动态地映射数据块。 根据该方法,通过将缓冲器高速缓存分成多个缓冲池来管理计算机系统中的缓冲区高速缓存。 在管理缓冲区高速缓存时,当请求数据项时,首先确定所请求的数据项是否存储在缓冲区高速缓存中的缓冲区中。 如果请求的数据项没有存储在缓冲区缓冲区中的缓冲区中,则动态地选择缓冲区高速缓存中的特定缓冲池来存储所请求的数据项。 一旦选择了特定的缓冲池,请求的数据项被存储在特定缓冲池中的缓冲区中。