Skip to main content
SpringerLink
Log in

Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

Abstract

We suggest weighted (k+1) B-trees, k≥1, for weighted dynamic dictionaries of items with k-dimensional keys. It is shown that they compare favorably with a data structure recently introduced for the same application.

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. Altenkamp, D. and Mehlhorn, K. (1980), Codes: Unequal probabilities, unequal letter costs, Journal of the ACM 27, 3 (July 1980), 412–427.

    Google Scholar 

  2. Bent, S.W., Sleator, D.D. and Tarjan, R.E. (1980), Biased 2–3 trees, Proc. 21st Annual Symposium on Foundations of Computer Science, 248–254.

    Google Scholar 

  3. Güting, H. and Kriegel, H.P. (1980), Multidimensional B-tree: An efficient dynamic file structure for exact match queries, Proc. 10th GI Annual Conference, Informatik Fachberichte Band 33, 375–388, Springer, Berlin-Heidelberg-New York.

    Google Scholar 

  4. Güting, H. and Kriegel, H.P. (1981), Dynamic k-dimensional multiway search under time-varying access frequencies, Proc. 5th GI-Conference on Theoretical Computer Science, Lecture Notes in Computer Science no. 104, 135–145, Springer, Berlin-Heidelberg-New York.

    Google Scholar 

  5. Kriegel, H.P. and Vaishnavi, V.K. (1981), A nearly optimal dynamic tree structure for partial-match queries with time-varying frequencies, Proc. 1981 Conference on Information Sciences and Systems, The Johns Hopkins University, Baltimore, Md., USA.

    Google Scholar 

  6. Mehlhorn, K. (1978), Arbitrary weight changes in dynamic trees, Bericht 78/04, Fachbereich 10 — Informatik, Universität des Saarlandes, Saarbrücken.

    Google Scholar 

  7. Mehlhorn, K. (1979), Dynamic binary search, SIAM J. COMPUTING 8,2 (May 1979), 175–198.

    Google Scholar 

  8. Sleator, D. and Tarjan, R.E. (1981), A data structure for dynamic trees, Proc. 13th Annual ACM Symposium on Theory of Computing, Milwaukee, Wisconsin, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik VI, Universität Dortmund, D-4600, Dortmund 50, W. Germany

    H. P. Kriegel

  2. Department of Computer Science, Ohio University, 45701, Athens, Ohio, USA

    V. K. Vaishnavi

Authors
  1. H. P. Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. K. Vaishnavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kriegel, H.P., Vaishnavi, V.K. (1981). Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_108

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation