Adaptive indexing for relational keys

: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking Adaptive indexing schemes such as database cracking and adaptive merging have been investigated to-date only in the context of range queries. These are typical for non-key columns in relational databases. For complete self-managing indexing, adaptive indexing must also apply to key columns. The present paper proposes a design and offers a first performance evaluation in the context of keys. Adaptive merging for keys also enables further improvements in B-tree indexes. First, partitions can be matched to levels in the memory hierarchy such as a CPU cache and an in-memory buffer pool. Second, adaptive merging in merged B-trees enables automatic master-detail clustering. External Posting Date: February 6, 2010 [Fulltext] Approved for External Publication Internal Posting Date: February 6, 2010 [Fulltext] To be pu...

• Type: Conference
• Year: 2010
• Where: ICDE
• Authors: Goetz Graefe, Harumi A. Kuno
• Keywords: Adaptive, Adaptive Indexing, Database, Databases, ICDE 2010