Relaxed multi-way trees with group updates

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 93-101

  Larsen, K S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DATABASE SYSTEMS; SEARCH ENGINES; WORLD WIDE WEB;

MULTIWAY TREES;

TREES (MATHEMATICS);

EID: 0034819977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375566     Document Type: Conference Paper

References (36)

1. Doklady Akadamii Nauk SSSR
2. Symmetric binary B-trees: Data structure and maintenance algorithms
3. Organization and maintenance of large ordered indexes
4. Concurrent rebalancing of AVL trees: A fine-grained approach
5. Amortization results for chromatic search trees, with an application to priority queues
6. Amortization results for chromatic search trees, with an application to priority queues
7. Efficient rebalancing of chromatic search trees
8. Efficient rebalancing of chromatic search trees
9. Analysis and performance of inverted data base structures
10. Hybrid index organizations for text databases
11. A dichromatic framework for balanced trees
12. The performance of concurrent red-black tree algorithms
13. Relaxed balanced red-black trees
14. Group updates for red-black trees
15. A new data structure for representing sorted lists
16. Variants of (a,b)-trees with relaxed balance
17. Batch insertion for tree structured file organizations - Improving differential database representation
18. AVL trees with relaxed balance
19. Amortized constant relaxed rebalancing using standard rotations
20. AVL trees with relaxed balance
21. B-trees with relaxed balance
22. Efficient rebalancing of B-trees with relaxed balance
23. Relaxed balance for search trees with local rebalancing
24. Relaxed balance through standard rotations
25. Group updates for relaxed height-balanced trees
26. An amortized analysis of insertions into AVL-trees
27. Uncoupling updating and rebalancing in chromatic binary search trees
28. Chromatic binary search trees - A structure for concurrent rebalancing
29. Concurrency control in database structures with relaxed balance
30. Relaxed AVL trees, Main-memory databases and concurrency
31. Concurrency control in B-trees with batch updates
32. Planar point location using persistent search trees
33. Relaxed balancing in search trees
34. Amortized computational complexity