| 发明名称 | Adaptive merging in database indexes | ||
| 摘要 | A method for implementing adaptive merging in database indexes includes selecting a key range from a database query having a range predicate and searching a database for data matching the key range. The data matching the key range is merged to form a collected dataset which is stored for future retrieval. A method for optimizing B-tree representation of a database using actual queries is also provided. | ||
| 申请公布号 | US9298761(B2) | 申请公布日期 | 2016.03.29 |
| 申请号 | US200912433418 | 申请日期 | 2009.04.30 |
| 申请人 | Hewlett Packard Enterprise Development LP | 发明人 | Graefe Goetz |
| 分类号 | G06F7/00;G06F17/30 | 主分类号 | G06F7/00 |
| 代理机构 | FabianVanCott | 代理人 | FabianVanCott |
| 主权项 | 1. A method for implementing adaptive merging in database indexes comprises: selecting a key range from a database query having a range predicate; searching a database for data matching the key range; merging the data matching the key range to form a collected data set; depositing the merged data within a newly-created partition within the B-tree index; making a second database query with a second query predicate which overlaps the key range in the new partition; gathering database data which falls within the second query predicate from the database to form a second query answer; and depositing a portion of data within the second query answer into the new partition to increase an amount of data contained within the new partition; and storing the collected data set for future retrieval, in which the data is indexed using a partitioned B-tree. | ||
| 地址 | Houston TX US | ||