Skip to main content
SpringerLink
Log in

A simple file structure for the weighted dictionary problem

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1993)

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

  • 110 Accesses

Abstract

A new file structure — weighted (a,b)-trees is proposed as a solution to the weighted dictionary problem. This file structure is not only optimal (in the worst case), to within a constant factor, but is simple and elegant as well. Weighted (a,b)-trees use the same restructuring operations as the well known B-trees — SPLIT, MERGE, and SHIFT. Furthermore, weighted (a,b)-trees are likely to prove to be the first known solution to the dynamic weighted dictionary problem with a constant amortized rebalancing cost per update.

The work of this author is partially supported by a research grant from College of Business Administration, GSU.

The work of this author is partially supported by a research grant from Kutztown Univ. of PA.

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. ADEL'SON-VEL'SKII, G.M. and E.M. LANDIS, An algorithm for the organization of information, Dokl. Akad. Nauk SSSR 146 (1962) 263–266 (in Russian); English translation in Soviet. Math. 3 (1962) 1259–1262.

    Google Scholar 

  2. AHO, A.V., J.E. HOPCROFT and J.D. ULLMANN, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).

    Google Scholar 

  3. BAYER, P.J., Improved bounds on the cost of optimal and balanced binary search trees, Tech. Report, Dept. of Computer Science, Massachusets Institute of Technology, Cambridge, MA, 1975.

    Google Scholar 

  4. BAYER, R. and E.M. McCREIGHT, Organization and maintenance of large ordered indices, Acta Inform. 1 (1972) 173–189.

    Google Scholar 

  5. BENT, S.W., D.D. SLEATOR and R.E. TARJAN, Biased search trees, SIAM J. Comput. 14 (3) (1985) 545–568.

    Google Scholar 

  6. FREDMAN, M.L., Two applications of a probabilistic search technique: sorting X+Y and building balanced search trees, in: Proc. 7th Ann. ACM Symp on Theory of Computing (1975) 240–244.

    Google Scholar 

  7. GARSIA, A.M. and M.L. WACHS, a new algorithm for minimal binary search trees, SIAM J. Comput. 6 (1977) 622–642.

    Google Scholar 

  8. GUETING, H. and H.P. KRIEGEL, Multidimensional B-tree: an efficient dynamic file structure for exact match queries, Informatik Fachberichte 33 (1980) 375–388.

    Google Scholar 

  9. GUIBAS, L.J. and R. SEDGEWICK, A dichromatic framework for balanced trees, in: Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science (1978) 8–21.

    Google Scholar 

  10. HU, T.C. and A.C TUCKER, Optimal computer-search trees and variable-length alphabetic codes, SIAM J. Appl. Math. 21 (1971) 514–532.

    Google Scholar 

  11. HUDDLESTON, S., and K. MEHLHORN, A new data structure for representing sorted lists, Acta Inform. 17 (1982) 157–184.

    Google Scholar 

  12. IYENGAR, S.S., RAO, N.S.V., KASHYAP, R.L. and VAISHNAVI, V.K., “Multidimensional data structures: review and outlook”, in: Advances in Computers(ed. M. Yovits), Vol. 27, 1988, Pp. 69–119.

    Google Scholar 

  13. KNUTH, D.E., Optimum binary search tree, Acta Inform. 1 (1971) 14–25.

    Google Scholar 

  14. KORSCH, J.F., Greedy binary search trees are nearly optimal, Inform. Process. Lett. 13 (1981) 16–19.

    Google Scholar 

  15. KRIEGEL, H.P. and V.K. VAISHNAVI, Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries, in: Proc. Mathematical Foundations of Computer Science, Strbske Pleso, Czhchoslovakia, lecture notes in computer science, Vol. 118 (Springer, Berlin, 1988) 14–23.

    Google Scholar 

  16. MEHLHORN, K., Nearly optimal binary search trees, Acta Inform. 5 (1975) 287–295.

    Google Scholar 

  17. MEHLHORN, K., Dynamic binary search, SIAM J. Comput. 8 (1979) 175–198.

    Google Scholar 

  18. MEHLHORN, K., Arbitrary weight changes in dynamic trees, RAIRO Inform. Théor. 15(3) (1981) 183–211.

    Google Scholar 

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

    Google Scholar 

  20. MEHLHORN, K., and A. TSAKALIDIS. Data structures. In: J. Van Leeuwen, editor, “Algorithms and Complexity”, Volume A, Chpt 6, pp 301–341, Elsevir, 1990.

    Google Scholar 

  21. NIEVERGELT, I. and E.M. REINGOLD, Binary search trees of bounded balance, SIAM J. Comput. 2 (1973)33–43.

    Google Scholar 

  22. OLIVIE, H.J., A new class of balanced search trees: half balanced binary search tree, RAIRO inform. Theor. 16 (1)(1982) 51–71.

    Google Scholar 

  23. OTTMAN, TH. and H.W. SIX, Eine neue Klasse von ausgeglichenen Baumen, Angewandte Informatik 18 (1976) 395–400.

    Google Scholar 

  24. SLEATOR, D.D. and R.E. TARJAN, Self-adjusting Binary Search Trees, J. ACM 32 (3) (1985) 652–686.

    Google Scholar 

  25. TARJAN, R.E., Updating a balanced search tree in O(1) rotations, Inform. Process. Lett. 16 (1983) 253–257.

    Google Scholar 

  26. VAISHNAVI, V.K., Weighted leaf AVL-trees, SIAM J. Comput. 16(3) (1987) 503–537.

    Google Scholar 

  27. VAISHNAVI, V.K., “Erratum: Weighted leaf AVL-trees, SIAM J. Comput. Vol 19, p. 591, 1990.

    Google Scholar 

  28. VAISHNAVI, V.K., and R.R. MIXON, Multidimensional (a,b)-trees: A Close look at the Neighbor-support Paradigm, Proc. Allerton Conf., pp 864–873, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Information Systems, Georgia State University, 30303, Atlanta, GA, USA

    V. K. Vaishnavi

  2. Department of Mathematics and Computer Science, Kutztown University of Pennsylvania, 19530, Kutztown, PA, USA

    D. Khanna

  3. Faculty of Computer Science, University of New Brunswick, E3B 5A3, Fredericton, N.B., Canada

    D. Khanna

Authors
  1. V. K. Vaishnavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Khanna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudrapatna K. Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vaishnavi, V.K., Khanna, D. (1993). A simple file structure for the weighted dictionary problem. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-57529-4_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57529-0

  • Online ISBN: 978-3-540-48211-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation