Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
ACM SIGMOD Record
Software—Practice & Experience
ACM Transactions on Database Systems (TODS)
Communications of the ACM
AlphaSort: a cache-sensitive parallel external sort
The VLDB Journal — The International Journal on Very Large Data Bases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Efficient Search of Multi-Dimensional B-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
Selecting an Optimal Set of Secondary Indices
Proceedings of the Proceedings of the 1st European Cooperation in Informatics on ECI Conference 1976
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Physical design refinement: The ‘merge-reduce’ approach
ACM Transactions on Database Systems (TODS)
Self-tuning database systems: a decade of progress
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Self-organizing strategies for a column-store database
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
Adaptive Segmentation for Scientific Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Benchmarking adaptive indexing
TPCTC'10 Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
Transactions on large-scale data- and knowledge-centered systems II
Transactions on large-scale data- and knowledge-centered systems II
Merging what's cracked, cracking what's merged: adaptive indexing in main-memory column-stores
Proceedings of the VLDB Endowment
New algorithms for join and grouping operations
Computer Science - Research and Development
Time-HOBI: Index for optimizing star queries
Information Systems
Stochastic database cracking: towards robust adaptive indexing in main-memory column-stores
Proceedings of the VLDB Endowment
Concurrency control for adaptive indexing
Proceedings of the VLDB Endowment
Foundations and Trends in Databases
Deferred maintenance of indexes and of materialized views
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Holistic indexing: offline, online and adaptive indexing in the same kernel
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
NoDB: efficient query execution on raw data files
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Adaptive indexing in modern database kernels
Proceedings of the 15th International Conference on Extending Database Technology
Invisible loading: access-driven data transfer from raw files into database systems
Proceedings of the 16th International Conference on Extending Database Technology
SMIX: self-managing indexes for dynamic workloads
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
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 database 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 is neither adaptive nor incremental. We propose adaptive merging, an adaptive, incremental, and efficient technique for index creation. Index optimization focuses on key ranges used in actual queries. The resulting index adapts more quickly to new data and to new query patterns than database cracking. Sort efficiency is comparable to that of traditional B-tree creation. Nonetheless, the new technique promises better query performance than database cracking, both in memory and on block-access storage.