Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Selecting an Optimal Set of Secondary Indices
Proceedings of the Proceedings of the 1st European Cooperation in Informatics on ECI Conference 1976
COLT: continuous on-line tuning
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
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
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
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
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
Merging what's cracked, cracking what's merged: adaptive indexing in main-memory column-stores
Proceedings of the VLDB Endowment
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
Stochastic database cracking: towards robust adaptive indexing in main-memory column-stores
Proceedings of the VLDB Endowment
Foundations and Trends in Databases
Holistic indexing: offline, online and adaptive indexing in the same kernel
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Scaling up analytical queries with column-stores
Proceedings of the Sixth International Workshop on Testing Database Systems
Hi-index | 0.00 |
Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query processing. The goal is to achieve the benefits of indexes while hiding or minimizing the costs of index creation. However, index-optimizing side effects seem to turn read-only queries into update transactions that might, for example, create lock contention. This paper studies concurrency control in the context of adaptive indexing. We show that the design and implementation of adaptive indexing rigorously separates index structures from index contents; this relaxes the constraints and requirements during adaptive indexing compared to those of traditional index updates. Our design adapts to the fact that an adaptive index is refined continuously, and exploits any concurrency opportunities in a dynamic way. A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism due to concurrent queries, (c) the number of concurrency conflicts and any concurrency administration overheads follow an adaptive behavior, decreasing as the workload evolves and adapting to the workload needs.