Summary
Binary search trees are shown to be reasonable alternatives to multiway trees for files stored in magnetic bubble memory. An algorithm for maintaining AVL trees is shown to be by far the most efficient of eight algorithms considered, when applied to secondary memory. A simplified model for analyzing the AVL algorithm is developed. A practical AVL algorithm for secondary memory is presented. Simulation results showing the performance of the AVL algorithm and a basic nonbalancing algorithm are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adel'Son-Vel'skii, G.M., Landis, Ye.M.: An algorithm for the organization of information. Soviet Math. 3, 1259–1263 (1962)
Allan, B., Munro, P.: Self-organizing binary search trees. 17th IEEE Symposium on Foundations of Computer Science, 1976, 166–172
Baer, J.L.: Weight-balanced trees. Proc. AFIPS 1975 NCC, Vol. 44, 467–472. Montvale, N.J.: AFIPS Press
Baer, J.L., Schwab, B.: A comparison of tree-balancing algorithms. Comm. ACM 20, 322–330 (1977)
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173–189 (1972)
Bruno, J., Coffman, E.G.: Nearly optimal binary search trees. IFIP Congress 1971, 99–103. Amsterdam: North-Holland
Chang, H.: Memory technology, magnetic bubbles. Encyclopedia of computer science and technology, Vol. 10 (J. Beizer, ed.) 274–384. New York: Marcel Dekker, 1978
Foster, C.C.: A generalization of AVL trees. Comm. ACM 16, 513–517 (1973)
Hu, T.C., Tucker, A.C.: Optimal computer search trees and variable-length alphabetical codes. SIAM J. Appl. Math. 21, 514–532 (1974)
Karlton, P.L., Fuller, S.H., Scroggs, R.E., Kaehler, E.B.: Performance of height-balanced trees. Comm. ACM 19, 23–28 (1976)
Knuth, D.E.: Optimum binary search trees. Acta Informat. 1, 14–25 (1971)
Knuth, D.E.: The art of computer programming, Vol. 3, 397–399. Reading, Massachuselts: Addison-Wesley 1973
Ibid, pp. 424–427
Ibid, pp. 451–463
Ibid, pp. 471–479
Martin, J.: Computer data-base organization, 2nd edn. Englewood Cliffs, N.J.: Prentice-Hall 1977
Mehlhorn, K.: Nearly optimal binary search trees. Acta Informat. 5, 287–295 (1975)
Mehlhorn, K.: Best possible bounds on the weighted path length of optimum binary search trees. SIAM J. Comput. 6, 235–239 (1977)
Myers, W.: Current developments in magnetic bubble technology. Computer 10, 73–82 (1977)
Nievergelt, J.: Binary search trees and file organization. Compul. Surveys 6, 195–207 (1974)
Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. SIAM J. Comput. 2, 33–43 (1973)
Nievergelt, J., Wong, C.K.: On binary search trees. Proceedings of IFIP Congress, pp. 91–98, 1971. Amsterdam: North Holland 1972
Nievergelt, J., Wong, C.K.: Upper bounds for the total path length of binary trees. J. ACM 20, 1–6 (1973)
Walker, W.A., Gottlieb, C.C.: A top down algorithm for constructing nearly optimal lexicographic trees. Graph theory and computing (R.C. Read ed.) pp. 302–323. New York: Academic Press 1972
Weiner, P.: On the heuristic design of binary search trees. Proc. Fifth Annual Princeton Conference, Princeton, N.J., 1971
Wright, W.E.: Dynamic binary search trees. Proc. 1978 Annual Conference of the ACM, pp. 370–374, 1978
Wright, W.E.: Organizing and accessing files for magnelic bubble memory and charge coupled devices. Proc. 1979 Annual Conference of the ACM, pp. 221–227, 1979
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wright, W.E. Binary search trees in secondary memory. Acta Informatica 15, 3–17 (1980). https://doi.org/10.1007/BF00269807
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00269807