Skip to main content
SpringerLink
Log in

B-trees

1972; Bayer, McCreight

  • Reference work entry
Encyclopedia of Algorithms

  • 240 Accesses

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 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988)

    Article  MathSciNet  Google Scholar 

  2. Arge, L.A.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–357. Kluwer, Dordrecht (2002)

    Google Scholar 

  3. Arge, L.A.: The Buffer Tree: A technique for designing batched external data structures. Algorithmica 37, 1–24 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arge, L.A., Hinrichs, K.H., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic R-trees. Algorithmica 33, 104–128 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Arge, L.A., Vitter, J.S.: Optimal external interval management. SIAM J. Comput. 32, 1488–1508 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Inform. 1, 173–189 (1972)

    Article  Google Scholar 

  7. Bayer, R., Schkolnick, M.: Concurrency of operations on B-trees. Acta Inform. 9, 1–21 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  8. Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-tree. VLDB J. 5, 264–275 (1996)

    Article  Google Scholar 

  9. Comer, D.E.: The ubiquitous B-tree. ACM Comput. Surv. 11, 121–137 (1979)

    Article  MATH  Google Scholar 

  10. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  11. Elmasri, R., Navanthe, S.B.: Fundamentals of Database Systems, 5th edn. Addison-Wesley, Boston (2007)

    Google Scholar 

  12. Graefe, G.: B-tree indexes for high update rates. SIGMOD RECORD 35, 39–44 (2006)

    Article  Google Scholar 

  13. Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists. Acta Inform. 17, 157–184 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jacobsen, L., Larsen, K.S., Nielsen, M.N.: On the existence of non-extreme (a, b)-trees. Inform. Process. Lett. 84, 69–73 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Jannink, J.: Implementing deletions in \( { {B}^+ } \)-trees. SIGMOD RECORD 24, 33–38 (1995)

    Article  Google Scholar 

  16. Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol. 3, 2nd edn. Addison-Wesley, Reading (1998)

    Google Scholar 

  17. Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science, vol. 1. Springer, Berlin (1984)

    Google Scholar 

  18. Yao, A.C.-C.: On random 2–3 trees. Acta Inform. 9, 159–170 (1978)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Dortmund University of Technology, Dortmund, Germany

    Jan Vahrenhold

Authors
  1. Jan Vahrenhold
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Vahrenhold, J. (2008). B-trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_57

Download citation

Publish with us

Policies and ethics

Search

Navigation