Database Paper Browser

Back to papers

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)

Paper ID
790
Venue
PODS
Year
1987
Pagerank
4.1945683e-05
Overall Rank
12,977 | 9.73%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
12,708 Group Updates for Relaxed Height-Balanced Trees 1999 PODS 4.1945683e-05
12,908 Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees 1991 PODS 4.1945683e-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.00029057817
604 Concurrency Control In A Dynamic Search Structure 1982 PODS 0.00019346532
1,276 Semantically-based Concurrency Control for Search Structures 1985 PODS 0.00012883569
1,309 Query Processing in Main Memory Database Management Systems 1986 SIGMOD 0.00012660929
Previous Page 1 / 1 Next

Semantically Similar Papers