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: 788
Venue: PODS
Year: 1987
Pagerank: 5.7232444e-05
Overall Rank: 7,026 | 51.80%
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,663	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00010073735

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.0020210012
464	Concurrent Operations on B-Trees with Overtaking	1985	PODS	0.00018055592
1,287	Abstraction in Recovery Management	1986	SIGMOD	0.00011320549
1,292	Concurrency Control In A Dynamic Search Structure	1982	PODS	0.0001130324
1,930	A Theoretical Foundation Of Multi-Level Concurrency Control	1986	PODS	9.4675042e-05
2,418	Concurrency Control in B+-Trees Databases Using Preparatory Operations	1985	VLDB	8.6059055e-05
2,480	Database Portals: A New Application Program Interface	1984	VLDB	8.5201824e-05
4,783	Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms	1984	PODS	6.5091522e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	14,548	On B-Trees: Routing Schemes And Concurrency	1980	SIGMOD
2	3,114	Access Method Concurrency with Recovery	1992	SIGMOD
3	13,175	Concurrency Control in Database Structures with Relaxed Balance	1987	PODS
4	2,227	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD
5	2,257	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS
6	464	Concurrent Operations on B-Trees with Overtaking	1985	PODS
7	5,530	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS
8	3,057	High-Concurrency Locking in R-Trees	1995	VLDB
9	1,663	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD
10	13,036	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB