Back to papers
Concurrent Operations on B-Trees with Overtaking
Summary: Presents concurrent B-tree algorithms that reduce updater locking to a single node (vs. 2–3 in LY), lowering contention during searches/inserts. Also introduces a concurrent compression/merge triggered on underflow deletions, with each compression locking up to three nodes.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 717
- Venue
- PODS
- Year
- 1985
- Pagerank
- 0.00029054939
- Overall Rank
- 282 | 98.05%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 175 |
ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes |
1990 |
VLDB |
0.00038354115 |
| 1,087 |
ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging |
1992 |
SIGMOD |
0.00014159274 |
| 1,238 |
Concurrency Control of Nested Transactions Accessing B-Trees |
1989 |
PODS |
0.00013093624 |
| 1,573 |
Performance of B-Tree Concurrency Control Algorithms |
1991 |
SIGMOD |
0.00011293832 |
| 1,988 |
A Practical Scalable Distributed B-Tree |
2008 |
VLDB |
9.8500023e-05 |
| 2,233 |
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems |
2001 |
VLDB |
9.2299873e-05 |
| 2,243 |
Lazy Updates for Distributed Search Structure |
1993 |
SIGMOD |
9.212156e-05 |
| 2,519 |
Concurrency and Recovery in Generalized Search Trees |
1997 |
SIGMOD |
8.6048934e-05 |
| 2,991 |
Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory |
2022 |
SIGMOD |
7.7701741e-05 |
| 3,042 |
High-Concurrency Locking in R-Trees |
1995 |
VLDB |
7.6669657e-05 |
| 3,251 |
Access Method Concurrency with Recovery |
1992 |
SIGMOD |
7.3198815e-05 |
| 5,239 |
A Framework for the Performance Analysis of Concurrent B-tree Algorithms |
1990 |
PODS |
5.6060584e-05 |
| 6,244 |
Operation Specific Locking In B-Trees |
1987 |
PODS |
5.1342001e-05 |
| 9,945 |
AB-tree: Index for Concurrent Random Sampling and Updates |
2022 |
VLDB |
4.240067e-05 |
| 12,770 |
Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems |
1997 |
SIGMOD |
4.1905499e-05 |
| 12,819 |
Index Concurrency Control in Firm Real-Time DBMS |
1995 |
VLDB |
4.1905499e-05 |
| 12,852 |
New Concurrency Control Algorithms for Accessing and Compacting B-Trees |
1994 |
VLDB |
4.1905499e-05 |
| 12,962 |
Concurrent Set Manipulation Without Locking |
1988 |
PODS |
4.1905499e-05 |
| 12,988 |
Concurrency Control in Database Structures with Relaxed Balance |
1987 |
PODS |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,317 |
Compact B-Trees |
1979 |
SIGMOD |
6.2824978e-05 |
| 1,986 |
On-line Reorganization of Sparsely-populated B+-trees |
1996 |
SIGMOD |
9.8572036e-05 |
| 12,988 |
Concurrency Control in Database Structures with Relaxed Balance |
1987 |
PODS |
4.1905499e-05 |
| 9,410 |
Revisiting B-tree Compression: An Experimental Study |
2024 |
SIGMOD |
4.3399748e-05 |
| 3,603 |
Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms |
1984 |
PODS |
6.9282296e-05 |
| 14,361 |
On B-Trees: Routing Schemes And Concurrency |
1980 |
SIGMOD |
- |
| 6,244 |
Operation Specific Locking In B-Trees |
1987 |
PODS |
5.1342001e-05 |
| 5,239 |
A Framework for the Performance Analysis of Concurrent B-tree Algorithms |
1990 |
PODS |
5.6060584e-05 |
| 1,573 |
Performance of B-Tree Concurrency Control Algorithms |
1991 |
SIGMOD |
0.00011293832 |
| 12,852 |
New Concurrency Control Algorithms for Accessing and Compacting B-Trees |
1994 |
VLDB |
4.1905499e-05 |