Designing fast architecture-sensitive tree search on modern multicore/many-core processors

Kim, Changkyu; Chhugani, Jatin; Satish, Nadathur; Sedlar, Eric; Nguyen, Anthony D.; Kaldewey, Tim; Lee, Victor W.; Brandt, Scott; Dubey, Pradeep

doi:10.1145/2043652.2043655

Cited by 33 publications

(40 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We consider three index structures: (i) AVLTree, (ii) B+-Tree, and (iii) the very recently proposed ART [15]. We choose ART since it outperforms other main-memory optimised search trees such as CSB+-Tree [17] and FAST [14].…”

Section: Extending Index Baselinesmentioning

confidence: 99%

The uncracked pieces in database cracking

Schuhknecht

Jindal²,

Dittrich

2013

Proc. VLDB Endow.

View full text Add to dashboard Cite

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 experimental study on database cracking. Our goal is to critically review several aspects, identify the potential, and propose promising directions in database cracking. With this study, we hope to expand the scope of database cracking and possibly leverage cracking in database engines other than MonetDB.We repeat several prior database cracking works including the core cracking algorithms as well as three other works on convergence (hybrid cracking), tuple-reconstruction (sideways cracking), and robustness (stochastic cracking) respectively. We evaluate these works and show possible directions to do even better. We further test cracking under a variety of experimental settings, including high selectivity queries, low selectivity queries, and multiple query access patterns. Finally, we compare cracking against different sorting algorithms as well as against different main-memory optimised indexes, including the recently proposed Adaptive Radix Tree (ART). Our results show that: (i) the previously proposed cracking algorithms are repeatable, (ii) there is still enough room to significantly improve the previously proposed cracking algorithms, (iii) cracking depends heavily on query selectivity, (iv) cracking needs to catch up with modern indexing trends, and (v) different indexing algorithms have different indexing signatures.

show abstract

Section: Extending Index Baselinesmentioning

confidence: 99%

The uncracked pieces in database cracking

Schuhknecht

Jindal²,

Dittrich

2013

Proc. VLDB Endow.

View full text Add to dashboard Cite

show abstract

“…Locality is increased by a) eliminating indirection, designing cache-conscious data structures like the CSB + -tree [28]; b) matching the data layout to the access pattern of the algorithm, i.e, store data that are accessed together in contiguous space; or c) reorganizing memory accesses to increase locality, e.g., with array [16] and tree blocking [14,32]. In this work, we assume that the index has the best possible implementation and locality cannot be further increased without penalizing single lookups.…”

Section: Tackling Cache Missesmentioning

confidence: 99%

Interleaving with coroutines

et al. 2017

View full text Add to dashboard Cite

Index join performance is determined by the efficiency of the lookup operation on the involved index. Although database indexes are highly optimized to leverage processor caches, main memory accesses inevitably increase lookup runtime when the index outsizes the last-level cache; hence, index join performance drops. Still, robust index join performance becomes possible with instruction stream interleaving: given a group of lookups, we can hide cache misses in one lookup with instructions from other lookups by switching among their respective instruction streams upon a cache miss.In this paper, we propose interleaving with coroutines for any type of index join. We showcase our proposal on SAP HANA by implementing binary search and CSB + -tree traversal for an instance of index join related to dictionary compression. Coroutine implementations not only perform similarly to prior interleaving techniques, but also resemble the original code closely, while supporting both interleaved and non-interleaved execution. Thus, we claim that coroutines make interleaving practical for use in real DBMS codebases.

show abstract

“…We consider three index structures: (1) AVL-tree [1], (2) B+-tree [3], and (3) the very recently proposed ART [20]. We choose ART since it outperforms other main memory optimized search trees such as CSB+-tree [24] and FAST [19].…”

Section: Extending Index Baselinesmentioning

confidence: 99%

An experimental evaluation and analysis of database cracking

Schuhknecht

Jindal²,

Dittrich

2015

The VLDB Journal

View full text Add to dashboard Cite

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. Our 2014 VLDB paper "The Uncracked Pieces in Database Cracking" (PVLDB 7:97-108, 2013/VLDB 2014 was the first comparative study of these different methods by an independent group. In this article, we extend our published experimental study on database cracking and bring it to an up-to-date state. Our goal is to critically review several aspects, identify the potential, and propose promising directions in database cracking. With this study, we hope to expand the scope of database cracking and possibly leverage cracking in database engines other than MonetDB. We repeat several prior database cracking works including the core cracking algorithms as well as three other works on convergence (hybrid cracking), tuple reconstruction (sideways cracking), and robustness (stochastic cracking), respectively. Additionally to our conference paper, we now also look at a recently published study about CPU efficiency (predication cracking). We evaluate these works and show possible directions to do even better. As a further extension, we evaluate the whole class of parallel cracking algorithms that were proposed in three recent works. Altogether, in this work we revisit 8 papers on database cracking and evaluate in total 18 cracking methods, 6 sorting algorithms, B Felix Martin Schuhknecht felix.schuhknecht@infosys.uni-saarland.de 1 Information Systems Group, Saarland University, Saarbrücken, Germany 2 CSAIL, MIT, Cambridge, MA, USA and 3 full index structures. Additionally, we test cracking under a variety of experimental settings, including high selectivity (Low selectivity means that many entries qualify. Consequently, a high selectivity means, that only few entries qualify) queries, low selectivity queries, varying selectivity, and multiple query access patterns. Finally, we compare cracking against different sorting algorithms as well as against different main memory optimized indexes, including the recently proposed adaptive radix tree (ART). Our results show that: (1) the previously proposed cracking algorithms are repeatable, (2) there is still enough room to significantly improve the previously proposed cracking algorithms, (3) parallelizing cracking algorithms efficiently is a hard task, (4) cracking depends heavily on query selectivity, (5) cracking needs to catch up with modern indexing trends, and (6) different indexing algorithms have different indexing signatures.

show abstract

Designing fast architecture-sensitive tree search on modern multicore/many-core processors

Cited by 33 publications

References 37 publications

The uncracked pieces in database cracking

The uncracked pieces in database cracking

Interleaving with coroutines

An experimental evaluation and analysis of database cracking

Contact Info

Product

Resources

About