Database Paper Browser

Back to papers

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
789
Venue
PODS
Year
1987
Pagerank
5.1383127e-05
Overall Rank
6,250 | 56.53%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,573 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00011295081
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers