Pages that link to "Item:Q3917524"
From MaRDI portal
The following pages link to Efficient locking for concurrent operations on B-trees (Q3917524):
Displaying 20 items.
- Contention-sensitive data structures and algorithms (Q526873) (← links)
- Concurrent operations on \(B^ *\)-trees with overtaking (Q579974) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- Global parallel index for multi-processors database systems (Q707311) (← links)
- Concurrent operations in linear hashing (Q918680) (← links)
- Analyzing the effects of hyperthreading on the performance of data management systems (Q934726) (← links)
- Concurrency and trie hashing (Q1112592) (← links)
- Unsafe operations in B-trees (Q1123655) (← links)
- Concurrent manipulation of expanded AVL trees (Q1130174) (← links)
- Transaction synchronisation in object bases (Q1176282) (← links)
- Concurrent operations in multi-attribute linear hashing (Q1310946) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- Key factors for improving performance of concurrency control algorithms (Q1602539) (← links)
- Operation-specific locking in balanced structures (Q1823659) (← links)
- Insertion-safeness in balanced trees (Q1838043) (← links)
- Public data structures: counters as a special case. (Q1853535) (← links)
- Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations (Q1857041) (← links)
- Confluence of processes and systems of objects (Q5096733) (← links)
- VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE (Q5249272) (← links)
- A process-calculus analysis of concurrent operations on B-trees (Q5943122) (← links)