Relaxed balance through standard rotations

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

Volumn 1272, Issue , 1997, Pages 450-461

  Larsen, Kim S ^a   Soisalon Soininen, Eljas ^b   Widmayer, Peter ^c  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b AALTO UNIVERSITY   (Finland)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; EMBEDDED SYSTEMS; FORESTRY; TREES (MATHEMATICS);

AVL TREE; BINARY SEARCH TREES; MAIN MEMORY; MAIN MEMORY DATABASE; MOBILE TELEPHONES; NEW APPLICATIONS; REBALANCING;

BINARY TREES;

EID: 0001630798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_82     Document Type: Conference Paper

References (14)

1. G.M. Adel’son-Vels’kii and E.M. Landis, An algorithm for the organisation of information. Soviet Math. Dokl. 3 (1962) 1259-1262.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data structures and algorithms. Addison-Wesley, 1983.
3. J. Boyar, R. Fagerberg, and K.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.
4. J. Boyar, R. Fagerberg, and K.S. Larsen, Amortization results for chromatic search trees, with an application to priority queues, Journal of Computer and System Sciences (to appear).
5. J. Boyar and K.S. Larsen, Efficient rebalancing of chromatic search trees. Journal of Computer and System Sciences 49 (1994) 667-682.
6. S. Hanke, T. Ottmann, and E. Soisalon-Soininen, Relaxed balanced red-black trees, Algorithms and Complexity, Third Italian Conference, Lecture Notes in Computer Science 1203 (1997) 193-204.
7. J.L.W. Kessels, On-the-fly optimization of data structures. Comm. ACM 26 (1983) 895-901.
8. K.S. Larsen, AVL trees with relaxed balance. In: Proc. 8th International Parallel Processing Symposium, IEEE Computer Society Press, 1994, pp. 888-893.
9. K.S. Larsen and R. Fagerberg, Efficient rebalancing of B-trees with relaxed balance. International Journal of Foundations of Computer Science, 7:2 (1996) 196-202.
10. O. Nurmi and E. Soisalon-Soininen, Uncoupling updating and rebalancing in chromatic binary search trees. In: Proc. 10th ACM Symposium on Principles of Database Systems, 1991, pp. 192-198.
11. O. Nurmi, E. Soisalon-Soininen and D. Wood, Concurrency control in database structures with relaxed balance. In: Proc. 6th ACM Symposium on Principles of Database Systems, 1987, pp. 170-176.
12. T. Ottmann and E. Soisalon-Soininen, Relaxed balancing made simple. Technical Report 71, Institut für Informatik, Universität Freiburg, Germany, 1995.
13. E. Soisalon-Soininen and P. Widmayer, Relaxed balancing in search trees. In: Advances in Algorithms, Languages, and Complexity (D.-Z. Du and K.-I. Ko, eds.), Kluwer Academic Publishers, 1997, pp. 267-283.
14. R.E. Tarjan, Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6:2 (1985) 306-318.