Pages that link to "Item:Q579974"
From MaRDI portal
The following pages link to Concurrent operations on \(B^ *\)-trees with overtaking (Q579974):
Displayed 13 items.
- Global parallel index for multi-processors database systems (Q707311) (← links)
- Distributing a \(B^+\)-tree in a loosely coupled environment (Q910190) (← links)
- Concurrency and trie hashing (Q1112592) (← links)
- Unsafe operations in B-trees (Q1123655) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041) (← links)
- ASA-graphs for efficient data representation and processing (Q2023584) (← links)
- On the correctness of a lock-free compression-based elastic mechanism for a hash trie design (Q2676227) (← links)
- Relaxed avl trees, main-memory databases and concurrency (Q2710798) (← links)
- VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE (Q5249272) (← links)
- A process-calculus analysis of concurrent operations on B-trees (Q5943122) (← links)
- A rigorous analysis of concurrent operations on B-trees (Q6044129) (← links)
- Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines (Q6180227) (← links)