Concurrent operations on \(B^ *\)-trees with overtaking

DOI10.1016/0022-0000(86)90021-8zbMath0625.68084OpenAlexW2039071499MaRDI QIDQ579974

Yehoshua Sagiv

Publication date: 1986

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(86)90021-8

zbMATH Keywords

compressiondatabasesdata structuredeletionsinsertions\(B^ *\)-treesconcurrent operationssearches

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

Concurrency and trie hashing ⋮ Unsafe operations in B-trees ⋮ Amortization results for chromatic search trees, with an application to priority queues ⋮ On the correctness of a lock-free compression-based elastic mechanism for a hash trie design ⋮ A rigorous analysis of concurrent operations on B-trees ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Distributing a \(B^+\)-tree in a loosely coupled environment ⋮ Relaxed avl trees, main-memory databases and concurrency ⋮ Global parallel index for multi-processors database systems ⋮ A process-calculus analysis of concurrent operations on B-trees ⋮ ASA-graphs for efficient data representation and processing ⋮ VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE ⋮ Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations

Cites Work

• Unnamed Item
• Concurrent search and insertion in 2-3 trees
• B-trees in a system with multiple users
• Concurrency of operations on B-trees
• Organization and maintenance of large ordered indexes
• Concurrent manipulation of binary search trees
• Efficient locking for concurrent operations on B-trees
• A New Method for Concurrency in B-Trees