Database Paper Browser

Back to papers

On the Power of Locking

Summary: Assesses the expressive power of locking primitives for concurrency control. Gives a necessary-and-sufficient condition to implement a CC principle with binary semaphores and characterizes precisely which lock sets are no more powerful than binary semaphores. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2153
Venue
SIGMOD
Year
1981
Pagerank
6.0849734e-05
Overall Rank
4,561 | 68.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
332 On Concurrency Control by Multiple Versions 1982 PODS 0.00027208023
1,563 Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking 1983 VLDB 0.00011352203
3,423 Is Distributed Locking Harder? 1982 PODS 7.1133874e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
347 An Optimality Theory of Concurrency Control for Databases 1979 SIGMOD 0.00026610677
Previous Page 1 / 1 Next

Semantically Similar Papers