Database Paper Browser

Back to papers

DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE (Extended Abstract)

Summary: Shows deadlock-freedom checking for lock-based transactions in distributed DBs is coNP-complete even for two transactions, contrasting polynomial centralized case. Gives poly-time algorithms when number of sites is fixed, and for safety/deadlock with fixed #transactions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
725
Venue
PODS
Year
1985
Pagerank
4.1945683e-05
Overall Rank
13,011 | 9.49%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
3,423 Is Distributed Locking Harder? 1982 PODS 7.1133874e-05
6,036 Consistency, Concurrency, And Crash Recovery 1978 SIGMOD 5.2415551e-05
Previous Page 1 / 1 Next

Semantically Similar Papers