Sciweavers

Share
EDBT
2010
ACM

Self-selecting, self-tuning, incrementally optimized indexes

11 years 6 months ago
Self-selecting, self-tuning, incrementally optimized indexes
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a relational data warehouse with many tables, the number of possible and promising indexes exceeds human comprehension and requires automatic index tuning. While monitoring and reactive index tuning have been proposed, adaptive indexing focuses on adapting the physical data-base layout for and by actual queries. "Database cracking" is one such technique. Only if and when a column is used in query predicates, an index for the column is created; and only if and when a key range is queried, the index is optimized for this key range. The effect is akin to a sort that is adaptive and incremental. This sort is, however, very inefficient, particularly when applied on block-access devices. In contrast, traditional index creation sorts data with an efficient merge sort optimized for block-access devices, but it ...
Goetz Graefe, Harumi A. Kuno
Added 18 May 2010
Updated 18 May 2010
Type Conference
Year 2010
Where EDBT
Authors Goetz Graefe, Harumi A. Kuno
Comments (0)
books