Relaxed multi-way trees with group updates.
From MaRDI portal
Publication:1401964
DOI10.1016/S0022-0000(03)00027-8zbMath1054.68045MaRDI QIDQ1401964
Publication date: 19 August 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Complexity; Search trees; Amortized analysis; B-trees; Group insertion; Group update; Multi-way trees; Relaxed balance
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Batch insertion for tree structured file organizations - improving differential database representation
- Amortized constant relaxed rebalancing using standard rotations
- A new data structure for representing sorted lists
- Efficient rebalancing of chromatic search trees
- Amortization results for chromatic search trees, with an application to priority queues
- On the existence and construction of non-extreme \((a,b)\)-trees.
- Chromatic binary search trees: A structure for concurrent rebalancing
- Organization and maintenance of large ordered indexes
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Relaxed avl trees, main-memory databases and concurrency
- An Amortized Analysis of Insertions into AVL-Trees
- Amortized Computational Complexity
- Analysis and performance of inverted data base structures
- EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
- VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
- AVL trees with relaxed balance
- relaxed balance for search trees with local rebalancing
- Relaxed balance using standard rotations
