Skip to main content
SpringerLink
Log in

B-Trees and Databases, Past and Future

  • Chapter
  • First Online:
Software Pioneers

Abstract

B-Trees are a data structure for organizing and managing very large data volumes on peripheral computer stores. B-Trees were developed in 1969 by R. Bayer and E. McCreight; they have superb properties with respect to performance and scalability in multiuser environments.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. R. Bayer, M. Schkolnick: Concurrency of operations on B-Trees. IBM Res. Report R5 1791 (May 1976), and Acta Informatica 9, 1–21 (1977).

    MATH  Google Scholar 

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

    Google Scholar 

  5. D. Comer: The ubiquitous B-Tree: Computing Surveys 11,121–137 (1979).

    Google Scholar 

  6. E. F. Codd: A relational model of data for large shared data banks. Communications of the ACM, 13, 6 (June 1970).

    Article  Google Scholar 

  7. E. F. Codd: A data base sublanguage founded on the relational calculus. In: Proceedings, 1971 ACM SIGFIDET workshop on Data Description, Access and Control, ACM.

    Google Scholar 

  8. E. F. Codd: Seven steps to rendezvous with the casual user. In: Proceedings, IFIP-TC2 Conference on Database Management (April 1–5,1974), 179–200, Cargese, Corsica.

    Google Scholar 

  9. System R Reunion: http://ftp.digital.com/pub/DEC/SRC/technical-notes/SRC-l997–018-html/sqlr95.html

    Google Scholar 

  10. F. Ramsak, V. Markl, R. Fenk, M. Zirkel, K. Elhardt, R. Bayer: Integrating the UB-Tree into a database system kernel. In: Proceedings, VLDB 2000 (Sept. 2000), 263–272, Cairo, Egypt.

    Google Scholar 

  11. M. Ley: http://www.informatik.uni-trier.de/~ley/db/index.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität, München, Germany

    Rudolf Bayer (Professor of Informatics)

Authors
  1. Rudolf Bayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Manfred Broy (Professor of Informatics) (Professor of Informatics)

  2. sd&m AG software design & management, Postfach 83 08 51, 81708, München, Germany

    Ernst Denert (Chairman of the Supervisory Board) (Chairman of the Supervisory Board)

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bayer, R. (2002). B-Trees and Databases, Past and Future. In: Broy, M., Denert, E. (eds) Software Pioneers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59412-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59412-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63970-8

  • Online ISBN: 978-3-642-59412-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation