Summary
The existence of purely top-down updating algorithms for balanced search trees is of importance when maintaining such trees in a concurrent environment, where purely top-down means a single sweep from the root to frontier along a search path. We present algorithms for internal- and external-search trees in the general framework of stratified trees. This enables us to demonstrate that many classes of balanced search trees have such updating schemes, although, for example, weight-balanced trees do not fit into this framework.
This is a preview of subscription content, log in via an institution to check access.
References
Aho, A.V., Hopcroft, J.E., Ullmann, J.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974
Aho, A.V., Hopcroft, J.E., Ullmann, J.D.: Data Structure and Algorithms. Reading, MA: Addison-Wesley 1983
Adel'son-Vel'skii, G.M., Landis, E.M.: An Information Organization Algorithm. Doklady Akad. Nauk SSR 146, 263–266 (1962), transl. Soviet Math. Dokl. 3, 1259–1262 (1962)
Bayer, R., McCreight, E.M.: Organisation and Maintenance of Large Ordered Indexes. Acta Inf. 1, 173–189 (1972)
Bentley, J.L., Kung, H.T.: Two Papers on a Tree-Structured Parallel Computer. Carnegie-Mellon University, Computer Science Technical Report CMU-CS-79-142, 1979
Guibas, L.J., Sedgewick, R.: A Dichromatic Framework for Balanced Trees. Proc. 19th Ann. IEEE Symp. Found. Comput Sci., pp. 8–21. Ann Arbor, 1978
Knuth, D.E.: The Art of Computer Programming, Vol. 3. Sorting and Searching. Reading, MA: Addison-Wesley 1973
Kwong, Y.S., Wood, D.: On B-Trees: Routing Schemes and Concurrency. Proc. 1980 ACM/SIGMOD Internat. Conf. Management of Data, pp. 207–213, 1980
Nievergelt, J., Reingold, E.M.: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2, 33–43 (1973)
Ottmann, T., Rosenberg, A.L., Snyder, L.J.: A Dictionary Machine (for VLSI), IEEE Trans. Comput. EC-31, 892–897 (1983)
Ottmann, T., Schrapp, M.: A Purely Top-Down Insertion Algorithm for 1–2 Brother Trees, University of Karlsruhe, Technical Report No. 92 (1980)
Ottmann, T., Schrapp, M.: 1-Pass Top-Down Update Schemes for Balanced Search Trees. Proc. 7th Conf. Graphtheoretic Concepts in Comput. Sci. WG81. J. Mühlbacher (ed.), pp. 279–292. Vienna: Hanser 1982
Ottmann, T., Schrapp, M., Wood, D.: On 1-Pass Top-Down Update Algorithms for Stratified Search Trees. University of Waterloo, Computer Science Technical Report CS-82-11 (1982)
Ottmann, T., Schrapp, M., Wood, D.: Weight Balanced Trees are not Stratified. (Unpublished manuscript, 1984
Ottmann, T, Wood, D.: 1–2 Brother Trees or AVL Trees Revisited, Comput J. 23, 248–255 (1980)
Schrapp, M.: 1-Pass Top-Down Update Schemes for Search Trees: Design, Analysis, and Application. Doctoral Dissertation, University Karlsruhe, 1984
van Leeuwen, J., Overmars, M.H.: Stratified Balanced Search Trees, Acta Inf. 18, 345–359 (1982)
Zaki, A.S.: Top-Down Deletion Algorithm for Minimum-Order B-Trees. University of Washington, Technical Report (ca. 1978)
Author information
Authors and Affiliations
Additional information
Work carried out partially under NATO Grant No. RG 155.81 and the work of the third author was partially supported by Natural Sciences and Engineering Research Council of Canada Grant No. A-5692
Rights and permissions
About this article
Cite this article
Ottmann, T., Schrapp, M. & Wood, D. Purely top-down updating algorithms for stratified search trees. Acta Informatica 22, 85–100 (1985). https://doi.org/10.1007/BF00290147
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00290147