Searching for "Approaches to Concurrency in B-Trees." – sorted by Relevance.
4 documents found, showing 1 through 4.
-
Efficient Locking for Concurrent Operations on B-Trees
- …. Efficient Locking for Concurrent Operations on B-Trees * 655 (a) 04 Fig. 5. Counterexample to naive approach…
- Cited by 120 (0 self) – Add To MetaCart
-
Implementing Distributed Search Structures
- … to the concurrent B-tree problem have been proposed [1], [10], [12], [16]. Each of these approaches uses some form…
- Cited by 4 (3 self) – Add To MetaCart
-
Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries
- … similar approach for concurrent B-trees). The explicit low-level manipulation of locks leads to a very…
- Cited by 1 (0 self) – Add To MetaCart
-
Concurrent rebalancing of AVL trees: A fine-grained approach
- … similar approach for concurrent B-trees). The explicit low-level manipulation of locks leads to a very…
- Cited by 5 (4 self) – Add To MetaCart
Showing 1 through 4.
