DBScholar

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
2215
Venue
SIGMOD
Year
1981
Pagerank
6.0157542e-05
Overall Rank
5,994 | 58.88%
DOI
10.1145/582318.582341

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{papadimitriou_sigmod81,
        title = {{On the Power of Locking}},
        author = {Papadimitriou, Christos H.},
        series = {{SIGMOD} '81},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582318.582341},
        url = {https://dl.acm.org/doi/10.1145/582318.582341},
        year = {1981}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
511 On Concurrency Control by Multiple Versions 1982 PODS 0.00017205623
2,072 Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking 1983 VLDB 9.2211825e-05
4,777 Is Distributed Locking Harder? 1982 PODS 6.5134169e-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
695 An Optimality Theory of Concurrency Control for Databases 1979 SIGMOD 0.00014910218
Previous Page 1 / 1 Next

Semantically Similar Papers