Database Paper Browser

Back to papers

Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees

Summary: Introduce chromatic (relaxed red‑black) BST rebalancing uncoupled from updates, enabling updates to hold fewer/shorter locks and complete faster. Rebalancing performed asynchronously as a continuous shadow process or off‑peak, progressively restoring balance while preserving search semantics. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
936
Venue
PODS
Year
1991
Pagerank
5.1725247e-05
Overall Rank
12,918 | 10.22%
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 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,274 Concurrency Control In A Dynamic Search Structure 1982 PODS 0.00011473517
12,988 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS 5.1725247e-05
Previous Page 1 / 1 Next

Semantically Similar Papers