Pages that link to "Item:Q1232296"
From MaRDI portal
The following pages link to Concurrency of operations on B-trees (Q1232296):
Displaying 21 items.
- Contention-sensitive data structures and algorithms (Q526873) (← links)
- Concurrent operations on \(B^ *\)-trees with overtaking (Q579974) (← links)
- \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half (Q686641) (← links)
- Global parallel index for multi-processors database systems (Q707311) (← links)
- Commutativity-based locking for nested transactions (Q753480) (← links)
- Concurrent operations in linear hashing (Q918680) (← links)
- Shifting timestamps for concurrency control in an information hierarchy (Q1107300) (← links)
- On the average number of rebalancing operations in weight-balanced trees (Q1140428) (← links)
- Transaction synchronisation in object bases (Q1176282) (← links)
- Concurrent operations in multi-attribute linear hashing (Q1310946) (← links)
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores (Q1656883) (← 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)
- The CB tree: a practical concurrent self-adjusting search tree (Q2256968) (← links)
- Relaxed avl trees, main-memory databases and concurrency (Q2710798) (← links)
- (Q3300815) (← links)
- (Q3313267) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- A process-calculus analysis of concurrent operations on B-trees (Q5943122) (← links)
