Database Paper Browser

Back to papers

Transaction Commitment At Minimal Communication Cost

Summary: Defines commit cost as network hops and proves a tight necessary-and-sufficient lower bound linking commit communication structure to network topology. Presents a simple distributed algorithm that attains this minimal-hop bound and is time-optimal within a natural class of protocols. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
783
Venue
PODS
Year
1987
Pagerank
4.1945683e-05
Overall Rank
12,976 | 9.73%
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 3 of 3 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
377 Impossibility of Distributed Consensus with One Faulty Process 1983 PODS 0.00025059979
6,936 On The Complexity Of Commit Protocols 1985 PODS 4.8925595e-05
Previous Page 1 / 1 Next

Semantically Similar Papers