The Uncracked Pieces in Database Cracking

@article{Schuhknecht2013TheUP,
  title={The Uncracked Pieces in Database Cracking},
  author={Felix Schuhknecht and Alekh Jindal and Jens Dittrich},
  journal={Proc. VLDB Endow.},
  year={2013},
  volume={7},
  pages={97-108}
}
Database cracking has been an area of active research in recent years. The core idea of database cracking is to create indexes adaptively and incrementally as a side-product of query processing. Several works have proposed different cracking techniques for different aspects including updates, tuple-reconstruction, convergence, concurrency-control, and robustness. However, there is a lack of any comparative study of these different methods by an independent group. In this paper, we conduct an… 
An experimental evaluation and analysis of database cracking
TLDR
This article revisits 8 papers on database cracking and evaluates in total 18 cracking methods, 6 sorting algorithms, and 3 full index structures, and evaluates the whole class of parallel cracking algorithms that were proposed in three recent works.
An analysis and comparison of database cracking kernels
TLDR
This work proposes both an advanced version of the best existing kernel as well as a new and unconventional approach, which utilizes features of the operating system aswell as data parallelism.
SPST-Index : a self pruning splay tree index for database cracking
TLDR
This work presents the Self-Pruning Splay Tree (SPST) data structure to index database cracking and reorganize "Hot Data" and "Cold Data" to boost the access to the cracked partitions.
Cracking KD-Tree : o primeiro índice adaptativo multidimensional = Cracking KD-Tree : the first multidimensional adaptive indexing
TLDR
This dissertation proposes an alternative, the Cracking KD-Tree, which is an adaptive data structure used for multidimensional queries, which had more or comparable efficiency with respect to total workload response time.
SPST-Index: A Self-Pruning Splay Tree Index for Caching Database Cracking
TLDR
The Self-Pruning Splay Tree (SPST) data structure to index database cracking is presented and it outperforms the AVL tree for lookups and maintenance costs in three major data access patterns: random, sequential and skewed.
Cracking In-Memory Database Index A Case Study for Adaptive Radix Tree Index
Database cracking: fancy scan, not poor man's sort!
TLDR
An in-depth study of the reasons for the low CPU efficiency of pivoted partitioning is conducted and an optimized version with significantly higher (single-threaded) CPU efficiency is developed.
Progressive Indices: Indexing Without Prejudice
TLDR
Progressive Indexing is envisioned, a new indexing technique that improves database cracking by strictly limiting perquery indexing cost to a budget (e.g., a user-defined fraction of scan costs), allowing the first and subsequent queries to complete without heavy penalties.
Closing the circle of algorithmic and system-centric database optimization: a comprehensive survey on adaptive indexing, data partitioning, and the rewiring of virtual memory
TLDR
This thesis reinvestigate, analyze, and enhance the class of adaptive indexing methods in a comprehensive evaluation on the algorithmic level, and investigates how virtual and physical memory can be separated in user space and how the mappings between the two memory types can be rewired freely at runtime.
Spatial Database Cracking with Quadtrees
TLDR
These algorithms are proposed, which are the first incremental and query-driven algorithms for cracking quadtrees, and can reduce the query response time of the first query in a sequence by 67% and the total cumulative query execution time ofThe first 200 queries by 17%.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
Updating a cracked database
TLDR
This paper introduces several novel algorithms for high-volume insertions, deletions and updates against a cracked database and shows that the nice performance properties of a cracking database can be maintained in a dynamic environment where updates interleave with queries.
Database Cracking
TLDR
This paper presents the first mature cracking architecture and reports on the implementation of cracking in the context of a full fledged relational system, leading to a minor enhancement to its relational algebra kernel, such that cracking could be piggy-backed without incurring too much processing overhead.
Cracking the Database Store
TLDR
This work developed a small representative multi-query benchmark and ran experiments against several open-source DBMSs to study the potentials for a significant reduction in system complexity with clear performance benefits.
Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores
TLDR
Stochastic cracking is introduced, a significantly more resilient approach to adaptive indexing that maintains the desired properties of original database cracking while at the same time it performs well with diverse realistic workloads.
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
TLDR
A family of hybrid algorithms designed and implemented in the context of a column-store database system significantly improve over past methods while at least two of the hybrids come very close to the "ideal performance" in terms of both overhead per query and convergence to a final state.
Self-organizing tuple reconstruction in column-stores
TLDR
A novel design, partial sideways cracking, is proposed that achieves performance similar to using presorted data, but without requiring the heavy initial presorting step itself, and brings significant performance benefits for multi-attribute queries.
A Comparison of Knives for Bread Slicing
TLDR
An exhaustive experimental study of several vertical partitioning algorithms along three dimensions and identifies the major differences in the use-case settings for different algorithms and describes how to make an apples-to-apples comparison under the same setting.
Self-selecting, self-tuning, incrementally optimized indexes
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
Concurrency Control for Adaptive Indexing
TLDR
It is shown that the design and implementation of adaptive indexing rigorously separates index structures from index contents; this relaxes the constraints and requirements during adaptive indexed compared to those of traditional index updates, and exploits any concurrency opportunities in a dynamic way.
The adaptive radix tree: ARTful indexing for main-memory databases
Main memory capacities have grown up to a point where most databases fit into RAM. For main-memory database systems, index structure performance is a critical bottleneck. Traditional in-memory data
...
1
2
...