Skip to main content
SpringerLink
Log in

Unbalanced multiway trees improved by partial expansions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Unbalanced multiway trees are generally impractical external data structures because of their poor space performance. In order to avoid this handicap, we have adapted the technique of partial expansions to these trees. Compared to partially expandedB +-trees in terms of average performance, the method proposed is faster, has more compact indexes, and shows the same almostoptimal asymptotic space performance at the data bucket level.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramowitz, M., Stegun, I.: Handbook of mathematical functions. New York: Dover 1972

    Google Scholar 

  2. Baeza-Yates, R.A., Larson, P.-A.: Analysis of B+-trees with partial expansions. IEEE Trans. Knowl. Data Eng.1 (3), 248–257 (1989)

    Google Scholar 

  3. Baeza-Yates, R.A.: A storage allocation algorithm suitable for file structures. Inf. Syst.15 (5), 515–521 (1990)

    Google Scholar 

  4. Bayer, R., Mc Creight, E.: Organization and maintenance of large ordered indexes. Acta Inf.14, 173–189 (1972)

    Google Scholar 

  5. Cunto, W., Poblete, P.V.: Transforming unbalanced multiway trees into a practical external data structure. Acta Inf.26, 193–211 (1988)

    Google Scholar 

  6. Eisenbarth, B., Ziviani, N., Gonnet, G.H., Mehlhorn, K., Wood, D.: The theory of fringe analysis and its application to 2–3 trees and B-trees. Inf. Control55(1–3), 173–189 (1982)

    Google Scholar 

  7. Frederickson, G.N.: Improving storage utilization in balanced trees. 7th Allerton Conference, Monticello, USA, pp. 255–264 (1979)

  8. Knuth, D.E.: The art of computer programming, vol I. Fundamental algorithms, 2nd ed. Reading, MA: Addison Wesley 1973

    Google Scholar 

  9. Knuth, D.E.: The art of computer programming, vol III. Sorting and searching. Reading MA: Addison Wesley 1973

    Google Scholar 

  10. Larson, P.-A.: Linear hashing with partial expansions. Proc. 6th Int. Conf. on Very Large Data Bases, Montreal, Canada, pp. 224–232 (1980)

  11. Lomet, D.: Partial expansions for file organizations with an index. ACM TODS12(1), 65–84 (1987)

    Google Scholar 

  12. Poblete, P.V., Munro, J.I.: The analysis of a fringe heuristic for binary search trees. J. Algorithms6, 336–350 (1985)

    Google Scholar 

  13. Yao, A.: On random 2–3 trees. Acta Inf.9, 159–170 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencias de la Computación, Universidad de Chile, Blanco Encalada 2120, Casilla 2777, Santiago, Chile

    Ricardo A. Baeza-Yates

  2. Centro Cientifico IBM de Venezuela, A.P. 64778, Caracas, Venezuela

    Walter Cunto

Authors
  1. Ricardo A. Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Cunto
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baeza-Yates, R.A., Cunto, W. Unbalanced multiway trees improved by partial expansions. Acta Informatica 29, 443–460 (1992). https://doi.org/10.1007/BF01193577

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01193577

Keywords

Search

Navigation