Single and bulk updates in stratified trees: An amortized and worst-case analysis

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

Volumn 2598, Issue , 2003, Pages 278-292

  Soisalon Soininen, Eljas ^a   Widmayer, Peter ^b  

^a AALTO UNIVERSITY   (Finland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARBITRARY ORDER; B TREES; BALANCED TREES; INSERTIONS AND DELETIONS; REBALANCING; RED BLACK TREE; SEARCH TREES; WORST-CASE ANALYSIS;

BINARY TREES;

EID: 35248880228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36477-3_21     Document Type: Article

References (26)

1. G.M. Adel'son-Vel'skii and E.M. Landis. An algorithm for the organisation of information. Dokl. Akad. Nauk SSSR 146 (1962), 263-266 (in Russian);
2. English Translation in Soviet. Math. 3, 1259-1262.
3. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1 (1972), 290-306.
4. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein: Introduction to Algorithms, Second Edition, The MIT Press, Cambridge, Massachusetts, 2001.
5. E.M. McCreight: Priority search trees. SIAM Journal on Computing 14 (1985), 257-276.
6. L.J. Guibas and R. Sedgewick: A dichromatic framework for balanaced trees. In: Proceedings of the 19th Annual IEEE Synposium on Foundations of Computer Science, Ann Arbor, pp. 8-21, 1978.
7. Chr. Icking, R. Klein, and Th. Ottmann: Priority search trees in secondary memory. In: Graph-theoretic Concepts in Computer Science (WG '87). Lecture Notes in Computer Science 314 (Springer-Verlag), pp. 84-93.
8. 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.
9. 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.
10. T.W. Lai and D. Wood: Adaptive heuristics for binary search trees and constant linkage cost. SIAM Journal on Computing 27:6 (1998), 1564-1591.
11. 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.
12. To appear in Journal of Computer and System Sciences.
13. J. van Leeuwen and M.H. Overmars: Stratified balanced search trees. Acta Informatica 18 (1983), 345-359.
14. 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.
15. K. Mehlhorn: Data Strucures and Algorithms, Vol. 1: Sorting and Searching, Springer-Verlag, 1986.
16. O. Nurmi, E. Soisalon-Soininen, and D. Wood: Concurrency control in database structures with relaxed balance. In: Proceedings of the Sixth ACM Symposium on Principles of Database Systems, pp. 170-176, 1987.
17. H.J. Olivie: A new class of balanced search trees: Half-balanced search trees. RAIRO Informatique Theorique 16 (1982), 51-71.
18. Th. Ottmann, and E. Soisalon-Soininen: Relaxed balancing made simple. Institut für Informatik, Universität Freiburg, Technical Report 71, 1995.
19. Th. Ottmann and P. Widmayer: Algorithmen und Datenstrukturen, 4. Auflage, Spektrum-Verlag, Heidelberg, 2002.
20. Th. Ottmann and D. Wood: Updating binary trees with constant linkage cost. International Journal of Foundations of Computer Science 3:4 (1992), 479-501.
21. K. Pollari-Malmi: Batch updates and concurrency control in in B-trees. Ph.D.Thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Report A38/02, 2002.
22. K. Pollari-Malmi, E. Soisalon-Soininen, and T. Ylönen: Concurrency control in B-trees with batch updates. IEEE Transactions on Knowledge and Data Engineering 8 (1996), 975-984.
23. N. Sarnak and R.E. Tarjan: Planar point location using persistent search trees. Communications of the ACM 29 (1986), 669-679.
24. H.-W. Six and D. Wood: Counting and reporting insersections of d-ranges. IEEE Transactions on Computers, C-31 (1982), 181-187.
25. D.D. Sleator and R.E. Tarjan: Self-adjusting binary search trees. Journal of the ACM 32 (1985), 652-686.
26. R.E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods 6 (1985), 306-318.