The adaptive radix tree: ARTful indexing for main-memory databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2013, Pages 38-49

  Leis, Viktor ^a   Kemper, Alfons ^a   Neumann, Thomas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED BINARY SEARCHES; EFFICIENT DATA STRUCTURES; INDEX STRUCTURE; INSERTIONS AND DELETIONS; LOOKUP PERFORMANCE; MAIN-MEMORY DATABASE; SPACE CONSUMPTION; SPACE EFFICIENT;

BINARY TREES; DATABASE SYSTEMS; FORESTRY; INDEXING (OF INFORMATION); RANDOM ACCESS STORAGE;

CACHE MEMORY;

FORESTRY; INDEXING; INFORMATION RETRIEVAL;

EID: 84881321263     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2013.6544812     Document Type: Conference Paper

References (32)

1. R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. C. Jones, S. Madden, M. Stonebraker, Y. Zhang, J. Hugg, and D. J. Abadi, "H-store: a high-performance, distributed main memory transaction processing system," PVLDB, vol. 1, 2008.
2. F. Färber, S. K. Cha, J. Primsch, C. Bornhövd, S. Sigg, and W. Lehner, "SAP HANA database: data management for modern business applications," SIGMOD Record, vol. 40, no. 4, 2012.
3. A. Kemper and T. Neumann, "HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots," in ICDE, 2011.
4. T. J. Lehman and M. J. Carey, "A study of index structures for main memory database management systems," in VLDB, 1986.
5. J. Rao and K. A. Ross, "Cache conscious indexing for decision-support in main memory," in VLDB, 1999.
6. B. Schlegel, R. Gemulla, and W. Lehner, "k-ary search on modern processors," in DaMoN workshop, 2009.
7. C. Kim, J. Chhugani, N. Satish, E. Sedlar, A. D. Nguyen, T. Kaldewey, V. W. Lee, S. A. Brandt, and P. Dubey, "FAST: fast architecture sensitive tree search on modern cpus and gpus," in SIGMOD, 2010.
8. R. Bayer and E. McCreight, "Organization and maintenance of large ordered indices," in SIGFIDET, 1970.
9. D. Comer, "Ubiquitous B-tree," ACM Comp. Surv., vol. 11, no. 2, 1979.
10. R. Bayer, "Symmetric binary B-trees: Data structure and maintenance algorithms," Acta Informatica, vol. 1, 1972.
11. L. Guibas and R. Sedgewick, "A dichromatic framework for balanced trees," IEEE Annual Symposium on the Foundations of Computer Science, vol. 0, 1978.
12. J. Rao and K. A. Ross, "Making B+ trees cache conscious in main memory," in SIGMOD, 2000.
13. G. Graefe and P.-A. Larson, "B-tree indexes and CPU caches," in ICDE, 2001.
14. R. De La Briandais, "File searching using variable length keys," in western joint computer conference, 1959.
15. E. Fredkin, "Trie memory," Commun. ACM, vol. 3, September 1960.
16. D. R. Morrison, "PATRICIA-practical algorithm to retrieve information coded in alphanumeric," J. ACM, vol. 15, no. 4, 1968.
17. D. E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, 1998.
18. N. Askitis and R. Sinha, "Engineering scalable, cache and space efficient tries for strings," The VLDB Journal, vol. 19, no. 5, 2010.
19. M. Böhm, B. Schlegel, P. B. Volk, U. Fischer, D. Habich, and W. Lehner, "Efficient in-memory indexing with generalized prefix trees," in BTW, 2011.
20. T. Kissinger, B. Schlegel, D. Habich, and W. Lehner, "KISS-Tree: Smart latch-free in-memory indexing on modern architectures," in DaMoN workshop, 2012.
21. D. Baskins, "A 10-minute description of how judy arrays work and why they are so fast," http://judy.sourceforge.net/doc/10minutes.htm, 2004.
22. A. Silverstein, "Judy IV shop manual," http://judy.sourceforge. net/doc/shop-interm.pdf, 2002.
23. G. Graefe, "Implementing sorting in database systems," ACM Comput. Surv., vol. 38, no. 3, 2006.
24. J. Corbet, "Trees I: Radix trees," http://lwn.net/Articles/ 175432/.
25. A. Appleby, "MurmurHash64A," https://sites.google.com/site/ murmurhash/.
26. J. Rao, "CSB+ tree source," http://www.cs.columbia.edu/ ∼kar/software/csb+/.
27. B. Schlegel, "K-ary search source," http://wwwdb.inf.tu- dresden.de/team/staff/dipl-inf-benjamin-schlegel/.
28. M. Boehm, "Generalized prefix tree source," http://wwwdb.inf.tu-dresden.de/research-projects/projects/dexter/ core-indexing-structure-and-techniques/.
29. V. Leis, "FAST source," http://www-db.in.tum.de/∼leis/ index/fast.cpp.
30. T. Yamamuro, M. Onizuka, T. Hitaka, and M. Yamamuro, "VAST-Tree: A vector-advanced and compressed structure for massive data tree traversal," in EDBT, 2012.
31. T. Neumann, "Efficiently compiling efficient query plans for modern hardware," PVLDB, vol. 4, 2011.
32. J. Krueger, C. Kim, M. Grund, N. Satish, D. Schwalb, J. Chhugani, H. Plattner, P. Dubey, and A. Zeier, "Fast updates on read-optimized databases using multi-core CPUs," PVLDB, vol. 5, 2011.