DBScholar

Back to papers

New Concurrency Control Algorithms for Accessing and Compacting B-Trees

Summary: Survey of B-tree concurrency control; proposes a new approach using variable-length indices, a single lock for access, and preemptive splits with delayed catenations. Also presents a concurrent compaction algorithm with its own lock type. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hf19ff68698bb9095
Venue
VLDB
Year
1994
Pagerank
4.9793485e-05
Overall Rank
13,326 | 10.41%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{setzer_vldb94,
        title = {{New Concurrency Control Algorithms for Accessing and Compacting B-Trees}},
        author = {Setzer, V. W. and Zisman, A.},
        journal = {PVLDB},
        series = {{VLDB} '94},
        pages = {238--249},
        year = {1994}
}

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
471 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.0001769727
2,471 Concurrency Control in B+-Trees Databases Using Preparatory Operations 1985 VLDB 8.4135005e-05
Previous Page 1 / 1 Next

Semantically Similar Papers