Database Paper Browser

Back to papers

On The Complexity Of Commit Protocols

Summary: Near-2 log n time lower bound for nonblocking commit protocols (2 log n - log log n - log log log n - O(1)), tightening prior bounds. Impossibility of simultaneously optimal time and message complexity for blocking/nonblocking commits and explicit time–message trade-offs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
740
Venue
PODS
Year
1985
Pagerank
4.8925595e-05
Overall Rank
6,936 | 51.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,976 Transaction Commitment At Minimal Communication Cost 1987 PODS 4.1945683e-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
375 Nonblocking Commit Protocols 1981 SIGMOD 0.00025176239
Previous Page 1 / 1 Next

Semantically Similar Papers