Database Paper Browser

Back to papers

Group Updates for Relaxed Height-Balanced Trees

Summary: Two-phase algorithm for sorted batch updates into height-balanced BSTs: eagerly apply updates without global rebalancing (only local subgroups between adjacent original keys) to keep O(log n) searches. Background local rebalancing restores height-balance with comparable cost. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1189
Venue
PODS
Year
1999
Pagerank
4.1945683e-05
Overall Rank
12,708 | 11.60%
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 3 of 3 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers