Skip to main content
SpringerLink
Log in

The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree

  • Conference paper
  • First Online:
In Memory Data Management and Analysis (IMDM 2013, IMDM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8921))

Abstract

Main-memory index structures have become mainstream for a large number of problem domains. However, in the case of web-based datasets, which feature exponential growth, it is an ongoing challenge to fit those data entirely in main-memory. In this paper, we present the DCB-Tree, an extremely space efficient main-memory index structure for the storage of short fixed-size keys. It features a two-stage cache-line aligned node layout. In comparison to other main-memory index structures it reduces the amount of memory required by 80 % in the best and by 30 % in the worst case. Although it is tailored towards space consumption, it features good overall performance characteristics. In particular, in the case of very large real world datasets it provides performance equal or superior to state of the art main-memory index structures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://tinyurl.com/on8ccx3.

  2. 2.

    http://dbis-informatik.uibk.ac.at/static/ma/robert/imdm/imdm2014.zip.

  3. 3.

    http://docs.oracle.com/javase/8/docs/api/java/util/TreeSet.html.

  4. 4.

    http://www-db.in.tum.de/~leis/index/ART.tgz?lang=de.

  5. 5.

    http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html.

References

  1. Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ISWC/ASWC 2007. LNCS, vol. 4825, pp. 722–735. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Bayer, R.: Symmetric binary B-Trees: data structure and maintenance algorithms. Acta Informatica 1(4), 290–306 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bayer, R., McCreight, E.: Organization and maintenance of large ordered indices. In: Proceedings of the SIGFIDET (now SIGMOD) 1970, p. 107. ACM Press, New York (1970)

    Google Scholar 

  4. Bayer, R., Unterauer, K.: Prefix B-Trees. ACM Trans. Database Syst. 2(1), 11–26 (1977)

    Article  Google Scholar 

  5. Binna, R., Gassler, W., Zangerle, E., Pacher, D., Specht, G.: SpiderStore: exploiting main memory for efficient RDF graph representation and fast querying. In: Proceedings of Workshop on Semantic Data Management (SemData) at VLDB (2010)

    Google Scholar 

  6. Bohannon, P., Mcllroy, P., Rastogi, R.: Main-memory index structures with fixed-size partial keys. In: Proceedings of SIGMOD 2001, vol. 30, pp. 163–174. ACM Press, New York, June 2001

    Google Scholar 

  7. Chen, S., Gibbons, P.B., Mowry, T.C., Valentin, G.: Fractal prefetching B+-Trees. In: Proceedings of SIGMOD 2002, p. 157. ACM Press, New York (2002)

    Google Scholar 

  8. Comer, D.: Ubiquitous B-Tree. ACM Comput. Surv. 11(2), 121–137 (1979)

    Article  MATH  Google Scholar 

  9. Fredkin, E.: Trie memory. Commun. ACM 3(9), 490–499 (1960)

    Article  Google Scholar 

  10. Gray, J.: Tape is dead, disk is tape, flash is disk, RAM locality is king, Gong Show Presentation at CIDR (2007)

    Google Scholar 

  11. Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: 19th Annual Symposium on Foundations of Computer Science (SCFS 1978), pp. 8–21. IEEE, October 1978

    Google Scholar 

  12. Hoffart, J., Suchanek, F.M., Berberich, K., Lewis-Kelham, E., de Melo, G., Weikum, G.: YAGO2: exploring and querying world knowledge in time, space, context, and many languages. In: Proceedings of WWW 2011, p. 229. ACM Press, New York (2011)

    Google Scholar 

  13. Kim, C., Chhugani, J., Satish, N., Sedlar, E., Nguyen, A.D., Kaldewey, T., Lee, V.W., Brandt, S.A., Dubey, P.: FAST: fast architecture sensitive tree search on Modern CPUs and GPUs. In: Proceedings of SIGMOD 2010, p. 339 (2010)

    Google Scholar 

  14. Lehman, T.J., Careay, M.J.: A study of index structures for main memory database management systems. In: Proceedings of VLDB 1986, pp. 294–303 (1986)

    Google Scholar 

  15. Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of ICDE 2013, pp. 38–49. IEEE, April 2013

    Google Scholar 

  16. Levandoski, J.J., Lomet, D.B., Sengupta, S.: The Bw-tree: A B-tree for new hardware platforms. In: Proceedings of ICDE 2013, pp. 302–313 (2013)

    Google Scholar 

  17. Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th ACM European Conference on Computer Systems - EuroSys 2012, p. 183 (2012)

    Google Scholar 

  18. Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. In: Proceedings of VLDB Endowment, vol. 1, pp. 647–659, August 2008

    Google Scholar 

  19. Rao, J., Ross, K.A.: Cache Conscious Indexing for Decision-Support in Main Memory. In: Proceedings of VLDB 1999, pp. 475–486. Morgan Kaufmann Publishers Inc. (1999)

    Google Scholar 

  20. Rao, J., Ross, K.A.: Making B+-Trees cache conscious in main memory. ACM SIGMOD Rec. 29(2), 475–486 (2000)

    Article  Google Scholar 

  21. Schlegel, B., Gemulla, R., Lehner, W.: k-ary search on modern processors. In: Proceedings of the Fifth International Workshop on Data Management on New Hardware - DaMoN 2009, p. 52. ACM Press, New York (2009)

    Google Scholar 

  22. Wulf, W.A., McKee, S.A.: Hitting the memory wall. ACM SIGARCH Comput. Archit. News 23(1), 20–24 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Databases and Information Systems, Institute of Computer Science, University of Innsbruck, Innsbruck, Austria

    Robert Binna, Dominic Pacher, Thomas Meindl & Günther Specht

Authors
  1. Robert Binna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominic Pacher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Meindl
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Günther Specht
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert Binna .

Editor information

Editors and Affiliations

  1. Samsung Corporation, San Jose, California, USA

    Arun Jagatheesan

  2. Microsoft Corporation, Redmond, Washington, USA

    Justin Levandoski

  3. Technische Universität München, Garching, Germany

    Thomas Neumann

  4. Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA

    Andrew Pavlo

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Binna, R., Pacher, D., Meindl, T., Specht, G. (2015). The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree. In: Jagatheesan, A., Levandoski, J., Neumann, T., Pavlo, A. (eds) In Memory Data Management and Analysis. IMDM IMDM 2013 2014. Lecture Notes in Computer Science(), vol 8921. Springer, Cham. https://doi.org/10.1007/978-3-319-13960-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13960-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13959-3

  • Online ISBN: 978-3-319-13960-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation