Concurrency Control in Database Structures with Relaxed Balance
Summary: Separates rebalancing from updates in balanced search trees (B-trees, AVL) by performing rebalancing via local background processes, yielding relaxed-balance structures. Enables simple concurrency control: only a small constant number of nodes need locks at any time, without extra links or node copies. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Otto Nurmi
- 2. Eljas Soisalon-Soininen
- 3. Derick Wood
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,717 | Group Updates for Relaxed Height-Balanced Trees | 1999 | PODS | 4.1905499e-05 |
| 12,918 | Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees | 1991 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 282 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.00029054939 |
| 599 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS | 0.00019426516 |
| 1,275 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS | 0.00012864455 |
| 1,337 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD | 0.00012515176 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,239 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 5.6060584e-05 |
| 3,603 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS | 6.9282296e-05 |
| 1,238 | Concurrency Control of Nested Transactions Accessing B-Trees | 1989 | PODS | 0.00013093624 |
| 599 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS | 0.00019426516 |
| 12,918 | Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees | 1991 | PODS | 4.1905499e-05 |
| 3,042 | High-Concurrency Locking in R-Trees | 1995 | VLDB | 7.6669657e-05 |
| 3,354 | An Abstract Model of Database Concurrency Control Algorithms | 1983 | SIGMOD | 7.1812114e-05 |
| 2,950 | The Performance Of Concurrency Control Algorithms For Database Management Systems | 1984 | VLDB | 7.8274188e-05 |
| 12,852 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1905499e-05 |
| 1,573 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00011293832 |