VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
From MaRDI portal
Publication:5249272
DOI10.1142/S012905410100059XzbMath1319.68065MaRDI QIDQ5249272
Publication date: 30 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
Relaxed multi-way trees with group updates. ⋮ On the existence and construction of non-extreme \((a,b)\)-trees.
Cites Work
- Concurrent operations on \(B^ *\)-trees with overtaking
- 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
- 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
- On-the-fly optimization of data structures
- Amortized Computational Complexity
- Efficient locking for concurrent operations on B-trees
- A New Method for Concurrency in B-Trees
- EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
- Unnamed Item
This page was built for publication: VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE