Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
Introspective sorting and selection algorithms
Software—Practice & Experience
Rethinking Database System Architecture: Towards a Self-Tuning RISC-Style Database System
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Selecting an Optimal Set of Secondary Indices
Proceedings of the Proceedings of the 1st European Cooperation in Informatics on ECI Conference 1976
Optimizing database architecture for the new bottleneck: memory access
The VLDB Journal — The International Journal on Very Large Data Bases
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
"One Size Fits All": An Idea Whose Time Has Come and Gone
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Database tuning advisor for microsoft SQL server 2005: demo
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
COLT: continuous on-line tuning
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
To tune or not to tune?: a lightweight physical design alerter
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
DB2 design advisor: integrated automatic physical database design
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Autonomous Management of Soft Indexes
ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Self-organizing tuple reconstruction in column-stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Self-selecting, self-tuning, incrementally optimized indexes
Proceedings of the 13th International Conference on Extending Database Technology
Benchmarking adaptive indexing
TPCTC'10 Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
Merging what's cracked, cracking what's merged: adaptive indexing in main-memory column-stores
Proceedings of the VLDB Endowment
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Concurrency control for adaptive indexing
Proceedings of the VLDB Endowment
Holistic indexing: offline, online and adaptive indexing in the same kernel
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
SMIX: self-managing indexes for dynamic workloads
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
Modern business applications and scientific databases call for inherently dynamic data storage environments. Such environments are characterized by two challenging features: (a) they have little idle system time to devote on physical design; and (b) there is little, if any, a priori workload knowledge, while the query and data workload keeps changing dynamically. In such environments, traditional approaches to index building and maintenance cannot apply. Database cracking has been proposed as a solution that allows on-the-fly physical data reorganization, as a collateral effect of query processing. Cracking aims to continuously and automatically adapt indexes to the workload at hand, without human intervention. Indexes are built incrementally, adaptively, and on demand. Nevertheless, as we show, existing adaptive indexing methods fail to deliver workload-robustness; they perform much better with random workloads than with others. This frailty derives from the inelasticity with which these approaches interpret each query as a hint on how data should be stored. Current cracking schemes blindly reorganize the data within each query's range, even if that results into successive expensive operations with minimal indexing benefit. In this paper, we introduce stochastic cracking, a significantly more resilient approach to adaptive indexing. Stochastic cracking also uses each query as a hint on how to reorganize data, but not blindly so; it gains resilience and avoids performance bottlenecks by deliberately applying certain arbitrary choices in its decision-making. Thereby, we bring adaptive indexing forward to a mature formulation that confers the workload-robustness previous approaches lacked. Our extensive experimental study verifies that stochastic cracking maintains the desired properties of original database cracking while at the same time it performs well with diverse realistic workloads.