DBScholar

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
724
Venue
PODS
Year
1985
Pagerank
5.093636e-05
Overall Rank
13,210 | 9.37%
DOI
10.1145/325405.325418

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{wolfson_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/325405.325418},
        doi = {10.1145/325405.325418},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Wolfson, Ouri and Yannakakis, Mihalis},
        year = {1985}
}

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
4,777 Is Distributed Locking Harder? 1982 PODS 6.5134169e-05
6,992 Consistency, Concurrency, And Crash Recovery 1978 SIGMOD 5.7303405e-05
Previous Page 1 / 1 Next

Semantically Similar Papers