Relaxed AVL trees, main-memory databases and concurrency

International Journal of Computer Mathematics

Volumn 62, Issue 1-2, 1996, Pages 23-44

  Nurmi, Otto ^a   Soisalon Soininen, Eljas ^b   Wood, Derick ^c  

^a UNIVERSITY OF HELSINKI   (Finland)

^b AALTO UNIVERSITY   (Finland)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Concurrency; Dictionary operations; Relaxed AVL tree; Search trees

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONCURRENCY CONTROL; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS;

DICTIONARY OPERATIONS; RELAXED AVL TREES; SEARCH TREES;

DATA STRUCTURES;

EID: 0030384576     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169608804523     Document Type: Article

References (28)

1. Adel'son-Vel'skii, G. M. and Landis, Y. M. (1962). An algorithm for the organization of information. Doklady Akademi Nauk, 146, 263-266.
2. Banker, G. B. (1978). List processing in real time on a serial computer. Communications of the ACM, 21, 280-294.
3. Bayer, R. and McCreight, E. (1972). Organization and maintenance of large ordered indexes. Acta Inforamtica, 1, 173-189.
4. Bayer, R. and Schkolnick, M. (1977). Concurrent operations on B-trees. Acta Informatica, 9, 1-21.
5. Boyar, J. and Larsen, K. S. (1992). Efficient rebalancing of chromatic search trees. In Proceeding of Third Scandinavian Workshop on Algorithm Theory-SWAT'92, 151-164.
6. Boyar, J. and Larsen, K. S. (1992). Efficient rebalancing of chromatic search trees. Journal of Computer and System Sciences, 49, 667-682.
7. Boyar. J., Fegerberg, R. and Larsen, K. S. (1995). Amortization results for chromatic search trees, with an application to priority queues. In Proceedings of the fourth International Workshop on Algorithms and Data Structures, WADS'95, 270-281.
8. Dijkstra, E. W., Lamport, L., Martin, A. J., Scholten, C. S. and Steffens, E. F. M. (1978). On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21, 966-975.
9. Ellis, C. S. (1980). Concurrent search and insertion in AVL trees. IEEE Transactions on Computers, C-29, 811-817.
10. Guibas, L. J. and Sedgewick, R. (1978). A dichromatic framework for balanced trees. In Proceeding of the 19th Annual Symposium on Foundations of Computer Science, 8-21.
11. Kessels, J. L. W. (1983). On-the-fly optimization of data structures. Communications of the ACM, 26, 895-901.
12. Knuth, D. E. (1973). The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Mass.
13. Kung, H. T. and Lehman, P. L. (1980). A concurrent database manipulation problem: Binary search trees. ACM Transactions on Database Systems, 3, 339-353.
14. Kwong, Y. S. and Wood, P. L. (1980). Approaches to concurrency in B-trees. In Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 88, 402-413.
15. Larsen, K. S. (1994). AVL trees with relaxed balance. In Proceedings of the Eighth International Parallel Processing Symposium, 888-893.
16. Larsen, K S. and Fagerberg. R. (1995). B-trees with relaxed balance. In Proceedings of the Ninth International Parallel Processing Symposium, 196-202.
17. Lehman, J. and Carey, M. J. (1986). A Study of Index Structures for Main Memory Database Management Systems. University of Wisconsin, Department of Computer Science Technical Report.
18. Manber, U. and Ladner, R. E. (1984). Concurrency control in a dynamic search structure. ACM Transactions on Database Systems, 9, 439-455.
19. Nurmi, O. and Soisalon-Soininen, E. (1991). Uncoupling updating and rebalancing in chromatic binary search trees. In Proceedings of the 10th ACM Symposium on Principles of Database Systems, 192-198.
20. Nurmi, O. and Soisalon-Soininen, E. (1996). to appear, Chromatic binary search trees : A structure for concurrent rebalancing. Acta Informatica.
21. Nurmi, O. Soisalon-Soininen, E. and Wood. D. (1987). Concurrency control in database structures with relaxed balance. In Proceedings of the Sixth ACM Symposium on Principles of Database Systems, 170-176.
22. Nurmi, O. Soisalon-Soininen, E. and Wood, D. (1993). Relaxed AVL Trees, Main-Memory Databases, and Concurrency. University of Western Ontario, Department of Computer Science Technical Report, 351.
23. Ottmann, Th. and Soisalon-Soininen, E. (1996). Relaxed balancing made simple. Unpublished manuscript.
24. Ottmann, Th. Schrapp, M. and Wood. D. (1985). Purely top-down updating algorithms for stratified search trees. Acta Informatica, 22, 85-100.
25. Sagiv, Y. (1986). Concurrent operations on B-trees with overtaking. Journal of Computer and System Sciences, 3, 275-296.
26. Soisalon-Soininen, E. and Widmayer, P. (1995). Relaxed balancing in binary search trees. Unpublished manuscript.
27. Soisalon-Soininen, E. and Wood, D. October (1986). AVL Trees. On-The-Fly Restructuring, and Concurrency. University of Waterloo, Department of Computer Science Research Report CS-86-52.
28. Stout, Q. F. and Warren, B. L. (1986). Tree rebalancing in optimal time and space. Communications of the ACM, 29, 902-908.