Group updates for red-black trees

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

Volumn 1767, Issue , 2000, Pages 253-262

  Hanke, Sabine ^a   Soisalon Soininen, Eljas ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DOCUMENT DATABASE; FULL TEXT INDEXING; FULL-TEXT INDEX; RED BLACK TREE; SEARCH STRUCTURES; SEARCH TREES; TYPICAL APPLICATION; UPDATE ALGORITHMS;

TREES (MATHEMATICS);

EID: 22844453408     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46521-9_21     Document Type: Article

References (16)

1. G.M Adel'son-Vels'kii and E.M. Landis. An algorithm for the organisation of information. Soviet Math. Dokl., 3:1259-1262, 1962.
2. J. Boyar, R. Fagerberg, and K. Larsen. Amortization results for chromatic search trees, with an application to priority queues. Journal of Computer and System Sciences, 55(3):504-521, 1997.
3. M. Brown and R. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing, 9(3):594-614, 1980.
4. C. Faloutsos and S. Christodoulakis. Design of a signature file method that accounts for non-uniform occurrence and query frequencies. In Proc. Intern. Conf. on Very Large Data Bases, pages 165-180, 1985.
5. C. Faloutsos and H.V. Jagadish. Hybrid text organizations for text databases. In Proc. Advances in Database Technology, volume 580 of LNCS, pages 310-327, 1992.
6. L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8-21, 1978.
7. S.D. Lang, J.R. Driscoll, and J.H. Jou. Batch insertion for tree-structured file organizations - improving differential database representation. Information Systems, 11(2):167-175, 1992.
8. K. Larsen. Amortized constant relaxed rebalancing using standard rotations. Acta Informatica, 35(10):859-874, 1998.
9. K. Larsen, E. Soisalon-Soininen, and P. Widmayer. Relaxed balance through standard rotations. In Proc. 5th Workshop on Algorithms and Data Structures, volume 1272 of LNCS, pages 450-461, August 1997.
10. L. Malmi and E. Soisalon-Soininen. Group updates for relaxed height-balanced trees. In Proc. 18th ACM Symposium on the Principles of Database Systems, pages 358-367, 1999.
11. C. Mohan and I. Narang. Algorithms for creating indexes for very large tables without quiescing updates. In Proc. 19th ACM SIGMOD Conf. on the Management of Data, pages 361-370, 1992.
12. O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees: A structure for concurrent rebalancing. Acta Informatica, 33:547-557, 1996.
13. K. Pollari-Malmi, E. Soisalon-Soininen, and T. Ylönen. Concurrency control in B- trees with batch updates. IEEE Transactions on Knowledge and Data Enineering, 8(6):975-983, 1996.
14. M. Rossi. Concurrent full text database. Master's thesis, Department of Computer Science, Helsinki University of Technology, Department of Computer Science and Engineering, Finland, 1997.
15. E. Soisalon-Soininen and P. Widmayer. Concurrency and recovery in full-text indexing. In Proc. Symposium on String Processing and Information Retrieval (SPIRE'99), pages 192-198. IEEE Computer Society, 1999.
16. V. Srinivasan and M.J. Carey. Performance of on-line index construction algorithms. In Proc. Advances in Database Technology, volume 580 of LNCS, pages 293-309, 1992.