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)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 645 | A Sophisticate's Introduction to Distributed Database Concurrency Control | 1982 | VLDB | 0.00018728491 |
| 13,011 | DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE (Extended Abstract) | 1985 | PODS | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 1,296 | A Locking Protocol For Resource Coordination In Distributed Databases | 1978 | SIGMOD | 0.00012758636 |
| 4,561 | On the Power of Locking | 1981 | SIGMOD | 6.0849734e-05 |
Previous
Page 1 / 1
Next