Amortized complexity of bulk updates in AVL-trees

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

Volumn 2368, Issue , 2002, Pages 439-448

  Soisalon Soininen, Eljas ^a   Widmayer, Peter ^b  

^a AALTO UNIVERSITY   (Finland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTIONAL CODES; TREES (MATHEMATICS);

AVL TREE; BULK OPERATIONS; INSERTIONS AND DELETIONS; LEAF POSITION; REBALANCING;

FORESTRY;

EID: 34547724279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_45     Document Type: Conference Paper

References (16)

1. G. M. Adel’son-Vel’skii and Landis. An algorithm for the organisation of information. Dokl. Akad. Nauk SSSR 146 (1962), 263–266 (in Russian); English Translation in Soviet. Math. 3, 1259–1262.
2. L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. Algorithmica 33 (2002), 104–128.
3. A. Gärtner, A. Kemper, D. Kossmann, B. Zeller. Efficient bulk deletes in relational databases. In: Proceedings of the 17th International Conference on Data Engineering. IEEE Computer Society, 2001, pp. 183–192.
4. S. Hanke and E. Soisalon-Soininen. Group updates for red-black trees. In: Proceedings of the 4th Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science 1767. Springer-Verlag, 2000, pp. 253–262.
5. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica 17 (1982), 157–184.
6. C. Jermaine, A. Datta, and E. Omiecinski. A novel index supporting high volume data warehouse insertion. In: Proceedings of the 25th International Conference on Very Large Databases. Morgan Kaufmann Publishers, 1999, pp. 235–246.
7. D. E. Knuth. The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition. Addison-Wesley, Reading, Mass., 1998.
8. T.-W. Kuo, C-H. Wei, and K.-Y. Lam. Real-time data access control on B-tree index structures. In: Proceedings of the 15th International Conference on Data Engineering. IEEE Computer Society, 1999, pp. 458–467.
9. K. S. Larsen. Relaxed multi-way trees with group updates. In: Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM Press, 2001, pp. 93–101.
10. L. Malmi and E. Soisalon-Soininen. Group updates for relaxed height-balanced trees. In: Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM Press, 1999, pp. 358–367.
11. K. Mehlhorn. Data Structures and Algorithms, Vol. 1: Sorting and Searching, Springer-Verlag, 1986.
12. K. Mehlhorn and A. Tsakalidis. An amortized analysis of insertions into AVL-trees. SIAM Journal on Computing 15:1 (1986), 22–33.
13. K. Pollari-Malmi, E. Soisalon-Soininen, and T. Ylönen. Concurrency control in Btrees with batch updates. IEEE Transactions on Knowledge and Data Engineering 8 (1996), 975–984.
14. K. Pollari-Malmi, J. Ruuth, and E. Soisalon-Soininen. Concurrency control in Btrees with differential indices. In: Proceedings of the International Database Engineering and Applications Symposium. IEEE Computer Society, 2000, pp. 287–295.
15. R. E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods 6 (1985), 306–318.
16. A. K. Tsakalidis. Rebalancing operations for deletions in AVL-trees. RAIRO Inform. Theorique 19:4 (1985), 323–329.