DBScholar

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
935
Venue
PODS
Year
1991
Pagerank
5.093636e-05
Overall Rank
13,103 | 10.11%
DOI
10.1145/113413.113430

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{nurmi_pods91,
        address = {New York, NY, USA},
        series = {{PODS} '91},
        title = {{Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees}},
        url = {https://dl.acm.org/doi/10.1145/113413.113430},
        doi = {10.1145/113413.113430},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Nurmi, Otto and Soisalon-Soininen, Eljas},
        year = {1991}
}

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,292 Concurrency Control In A Dynamic Search Structure 1982 PODS 0.0001130324
13,175 Concurrency Control in Database Structures with Relaxed Balance 1987 PODS 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers