DBScholar

Back to papers

Is Distributed Locking Harder?

Summary: Deciding if a set of locked transactions on a distributed database guarantees serializability is coNP-complete, vs. polynomial for centralized systems. Provides a geometric/hypergraph characterization of all correct locking policies, the exact power of locking, and a polynomial test for two-site systems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
615
Venue
PODS
Year
1982
Pagerank
6.5134169e-05
Overall Rank
4,777 | 67.23%
DOI
10.1145/588111.588129

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kanellakis_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Is Distributed Locking Harder?}},
        url = {https://dl.acm.org/doi/10.1145/588111.588129},
        doi = {10.1145/588111.588129},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kanellakis, Paris C. and Papadimitriou, Christos H.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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,299 A Locking Protocol For Resource Coordination In Distributed Databases 1978 SIGMOD 8.7874096e-05
5,994 On the Power of Locking 1981 SIGMOD 6.0157542e-05
Previous Page 1 / 1 Next

Semantically Similar Papers