A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Adaptive indexing for relational keys
2010
2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)
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
doi:10.1109/icdew.2010.5452743
dblp:conf/icde/GraefeK10
fatcat:sv5kfcsxh5bunleof4yckv44lm