Skip to main content
SpringerLink
Log in

Maintaining dictionaries: Space-saving modifications of B-trees

  • Conference paper
  • First Online:
Database Theory — ICDT '92 (ICDT 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 646))

Included in the following conference series:

Abstract

It is known that the data structure of B-trees leads to an exhaustive waste of memory, when lengths of keys differ very much from each other. This effect may be fixed with appropriate modifications of (he data structure. We introduce a variant of B-trees, called B-trees with unfixed key length, and compare it to another variant of B-trees, introduced by T.H. Martin, which we call B-trees with bounded key length. Space efficiency of those two variants is evaluated for the worst case. However, the efficiency for the more realistic average case remains unknown. We believe that in many applications B-trees with unfixed key length are more efficient.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.E. Knuth, “The Art of Computer Programming, vol. 3 (Sorting and Searching),” Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  2. T.J. Teorey, D.P. Fry, “Design of Database Structures, vol. 2,” Prentice-Hall, Englewood Cliffs, NJ, 1982.

    Google Scholar 

  3. N. Wirth, “Algorithms and Data Structure,” Prentice-Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  4. R. Bayer, Symmetric binary B-trees: Data Structure and Maintenance Algorithms, Acta Inf. 14 (1972), 290–306.

    Google Scholar 

  5. R. Bayer, E. McCreight, Organization and Maintenance of Large Ordered Indexes, Acta Inf. 13 (1972), 173–189.

    Google Scholar 

  6. D. Comer, The Ubiquitous B-Tree, Comp. Surv. 11 2 (1979), 121–137.

    Google Scholar 

  7. G.K. Gupta, B. Srinivasan, Approximate Storage Utilization of B-trees, Inf. Proc. Lett. 22 (1986), 243–246.

    MathSciNet  Google Scholar 

  8. S.-H.S. Huang, Height-Balanced Trees of Order (β, γ, α), ACM Trans. Database Syst. 10 2 (1985), 261–284.

    MathSciNet  Google Scholar 

  9. T. Johnson, D. Shasha, Utilization of B-Trees with Inserts, Deletes, and Modifies, In Proceedings of the ACM Principles of Database Systems Symposium (1989), 235–244.

    Google Scholar 

  10. G. Manacher, S.L. Graham, Pagination of B * -Trees with Variable-Length Records, Commun. ACM 20 9 (1977), 670–674.

    Google Scholar 

  11. A.L. Rosenberg, L. Snyder, Time-and Space-Optimality in B-Trees, ACM Trans. Database Syst. 6 1 (1981), 174–193.

    Google Scholar 

  12. W.E. Wright, Some Average Performance Measure for the B-tree, Acta Inf. 21 (1985), 541–557.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Program Systems Institute, Russian Academy of Sciences, P.O. Box 11, 152140, Pcrcslavl-Zalessky, Russia

    Anatoly P. Pinchuk & Konstantin V. Shvachko

Authors
  1. Anatoly P. Pinchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantin V. Shvachko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joachim Biskup Richard Hull

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinchuk, A.P., Shvachko, K.V. (1992). Maintaining dictionaries: Space-saving modifications of B-trees. In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-56039-4_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56039-5

  • Online ISBN: 978-3-540-47360-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation