Relaxed balance for search trees with local rebalancing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 350-363

  Larsen, Kim S ^a   Ottmann, Thomas ^b   Soisalon Soininen, Eljas ^c  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF FREIBURG   (Germany)

^c AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

LOCKS (FASTENERS); MEMORY ARCHITECTURE; PARALLEL ARCHITECTURES;

BOTTOM UP; LOCKING MECHANISM; PARALLEL IMPLEMENTATIONS; REBALANCING; SEARCH TREES; SEQUENTIAL SEARCH; SHARED MEMORY;

FORESTRY;

EID: 0039644681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_27     Document Type: Conference Paper

References (27)

1. G M. Adel’son-Vel’skii and E. M, Landis, An Algorithm for the Organisation of Information. Soviet Math. Doklady 3 (1962) 1259-1263.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms. Addison-Wesley, 1983.
3. Arne Andersson, Improving Partial Rebuilding by Using Simple Balance Criteria. "1st International Workshop on Algorithms and Data Structures", Lecture Notes in Computer Science 382 (1989) 393-402.
4. Cecilia R. Aragon and Raimund G. Seidel, Randomized Search Trees. Proceedings of the 30th Annual IEEE Symposium on the Foundations of Computer Science (1989) 540-545.
5. R. Bayer, Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms. Acta Informatica 1 (1972) 290-306.
6. R. Bayer and E. McCreight, Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1 (1972) 173-189.
7. Norbert Blum and Kurt Mehlhom, On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theoretical Computer Science 11 (1980) 303-320.
8. Joan Boyar, Rolf Fagerberg and Kim S. Larsen, Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. "Fourth International Workshop on Algorithms and Data Structures", Lecture Notes in Computer Science 955 (1994) 270-281. To appear in Journal of Computer and System Sciences.
9. Joan F. Boyar and Kim S. Larsen, Efficient Rebalancing of Chromatic Search Trees. Journal of Computer and System Sciences 49 (1994) 667-682.
10. Rolf Fagerberg, Personal communication, 1996.
11. Igal Galperin and Ronald L. Rivest, Scapegoat Trees. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993) 165-174.
12. Leo J. Guibas and Robert Sedgewick, A Dichromatic Framework for Balanced Trees. Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science (1978) 8-21.
13. S. Hanke, T. Ottmann and E. Soisalon-Soininen, Relaxed Balanced Red-Black Trees. "Proceedings 3rd Italian Conference on Algorithms and Complexity", Lecture Notes in Computer Science 1203 (1997) 193-204.
14. J. E. Hopcroft, Title unknown, 1970. Unpublished work on 2-3 trees.
15. Scott Huddleston and Kurt Mehlhom, A New Data Structure for Representing Sorted Lists. Acta Informatica 17 (1982) 157-184.
16. J. L. W. Kessels, On-the-Fly Optimization of Data Structures. Communications of the ACM 26 (1983) 895-901.
17. Kim S. Larsen, AVL Trees with Relaxed Balance. Proceedings of the 8th International Parallel Processing Symposium, IEEE Computer Society Press (1994) 888-893.
18. Kim S. Larsen and Rolf Fagerberg, Efficient Rebalancing of B-Trees with Relaxed Balance. International Journal of Foundations of Computer Science 7 (1996) 169-186.
19. Kurt Mehlhom and Athanasios Tsakafidis, An Amortized Analysis of Insertions into AVL-Trees. SIAM Journal on Computing 15 (1986) 22-33.
20. J. Nievergelt and M. Reingold, Binary Search Trees of Bounded Balance. SIAM Journal on Computing 2 (1973) 33-43.
21. O. Nurmi, E. Soisalon-Soininen and D. Wood, Concurrency Control in Database Structures with Relaxed Balance. Proceedings of the 6th ACM Symposium on Principles of Database Systems (1987) 170-176.
22. Otto Nurmi and Eljas Soisalon-Soininen, Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1991) 192-198.
23. H. J. Olivié, A New Class of Balanced Trees: Half-Balanced Binary Search Trees. R.A.LR.O. Informatique Théoretique 16 (1982) 51-71.
24. Th. Ottmann and E. Soisalon-Soininen, Relaxed Balsmcing Made Simple. Institut für Informatik, Universität Freiburg, Technical Report 71, 1995.
25. Neil Samak and Robert E. Tarjan, Planar Point Location Using Persistent Search Trees. Communications of the ACM 29 (1986) 669-679.
26. Daniel Dominic Sleator and Robert Endre Tarjan, Self-Adjusting Binary Trees. Proceedings of the 15th Annual ACM Symposium on the Theory of Computing (1983) 235-245.
27. Eljas Soisalon-Soininen and Peter Widmayer, Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity, D.-Z. Du and K.-I. Ko (Eds.), Kluwer Academic Publishers (1997) 267-283.