High-Concurrency Locking in R-Trees
Summary: R-link tree: a high-concurrency R-tree variant with B-link style sibling pointers for concurrent updates. Sequence numbers reconstruct lineage; operations avoid locks during I/O; degree-3 consistency with predicate locking; WAL recoverability; experiments show gains over basic locking. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 242 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00031110894 |
| 1,774 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB | 0.00010604097 |
| 2,502 | Integrating the UB-Tree into a Database System Kernel | 2000 | VLDB | 8.6438339e-05 |
| 2,516 | Concurrency and Recovery in Generalized Search Trees | 1997 | SIGMOD | 8.6106981e-05 |
| 2,738 | Indexing Large Trajectory Data Sets With SETI* | 2003 | CIDR | 8.2005452e-05 |
| 6,537 | Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads | 2012 | SIGMOD | 5.0235647e-05 |
| 7,365 | Effectively Indexing Uncertain Moving Objects for Predictive Queries | 2009 | VLDB | 4.7517889e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018397217 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 24 | The R+-Tree: A Dynamic Index For Multi-Dimensional Objects | 1987 | VLDB | 0.00083378538 |
| 26 | The Design Of The Postgres Storage System | 1987 | VLDB | 0.00082378685 |
| 174 | ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes | 1990 | VLDB | 0.00038347904 |
| 282 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.00029057817 |
| 1,573 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00011295081 |
| 3,244 | Access Method Concurrency with Recovery | 1992 | SIGMOD | 7.3262881e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,516 | Concurrency and Recovery in Generalized Search Trees | 1997 | SIGMOD | 8.6106981e-05 |
| 5,239 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 5.6106291e-05 |
| 2,246 | Parallel R-trees | 1992 | SIGMOD | 9.2075292e-05 |
| 1,243 | Concurrency Control of Nested Transactions Accessing B-Trees | 1989 | PODS | 0.00013096387 |
| 7,054 | Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability | 2018 | VLDB | 4.8496866e-05 |
| 3,596 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS | 6.9357398e-05 |
| 12,977 | Concurrency Control in Database Structures with Relaxed Balance | 1987 | PODS | 4.1945683e-05 |
| 12,843 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1945683e-05 |
| 6,250 | Operation Specific Locking In B-Trees | 1987 | PODS | 5.1383127e-05 |
| 1,573 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00011295081 |