Operation Specific Locking In B-Trees

Summary: Operation-specific, deadlock-free locking for B-trees where lock compatibility is based on node status and the set/kind of active operations rather than just lock type, allowing multiple concurrent inserts/deletes on a node. Includes failure recovery and protocol adaptations for B+-, compressed B-trees and R-trees. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: he57769130d67f183
Venue: PODS
Year: 1987
Pagerank: 5.5954112e-05
Overall Rank: 7,164 | 51.84%
DOI: 10.1145/28659.28676

Incoming Non-self Citations Over Time

Authors

1. Alexandros Biliris (Boston University)

BibTeX Citation

@inproceedings{biliris_pods87,
        address = {New York, NY, USA},
        series = {{PODS} '87},
        title = {{OPERATION SPECIFIC LOCKING IN B-TREES}},
        url = {https://dl.acm.org/doi/10.1145/28659.28676},
        doi = {10.1145/28659.28676},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Biliris, Alexandros},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,692	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	9.8570044e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.001992968
471	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.0001769727
1,309	Abstraction in Recovery Management	1986	SIGMOD	0.00011070982
1,316	Concurrency Control In A Dynamic Search Structure	1982	PODS	0.00011050625
1,983	A Theoretical Foundation Of Multi-Level Concurrency Control	1986	PODS	9.2560823e-05
2,471	Concurrency Control in B+-Trees Databases Using Preparatory Operations	1985	VLDB	8.4135005e-05
2,535	Database Portals: A New Application Program Interface	1984	VLDB	8.3333538e-05
4,904	Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms	1984	PODS	6.3633656e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	14,846	On B-Trees: Routing Schemes And Concurrency	1980	SIGMOD
2	3,170	Access Method Concurrency with Recovery	1992	SIGMOD
3	13,465	Concurrency Control in Database Structures with Relaxed Balance	1987	PODS
4	2,263	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD
5	2,297	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS
6	471	Concurrent Operations on B-Trees with Overtaking	1985	PODS
7	5,661	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS
8	3,111	High-Concurrency Locking in R-Trees	1995	VLDB
9	1,692	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD
10	13,326	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB