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 (University of Karlsruhe)
- 2. Eljas Soisalon-Soininen (University of Helsinki; University of Karlsruhe)
- 3. Derick Wood (University of Waterloo)
BibTeX Citation
@inproceedings{nurmi_pods87,
address = {New York, NY, USA},
series = {{PODS} '87},
title = {{Concurrency Control in Database Structures with Relaxed Balance}},
url = {https://dl.acm.org/doi/10.1145/28659.28677},
doi = {10.1145/28659.28677},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Nurmi, Otto and Soisalon-Soininen, Eljas and Wood, Derick},
year = {1987}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,191 | Group Updates for Relaxed Height-Balanced Trees | 1999 | PODS | 4.9793485e-05 |
| 13,393 | Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees | 1991 | PODS | 4.9793485e-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 |
|---|---|---|---|---|
| 471 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.0001769727 |
| 1,316 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS | 0.00011050625 |
| 1,384 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD | 0.00010845169 |
| 2,575 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS | 8.2761608e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,661 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |
| 2 | 4,904 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS |
| 3 | 2,297 | Concurrency Control of Nested Transactions Accessing B-Trees | 1989 | PODS |
| 4 | 1,316 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS |
| 5 | 13,393 | Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees | 1991 | PODS |
| 6 | 3,111 | High-Concurrency Locking in R-Trees | 1995 | VLDB |
| 7 | 4,265 | An Abstract Model of Database Concurrency Control Algorithms | 1983 | SIGMOD |
| 8 | 2,973 | The Performance of Concurrency Control Algorithms for Database Management Systems | 1984 | VLDB |
| 9 | 13,326 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 10 | 1,692 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD |