Database Paper Browser

Back to papers

How Fast can a Distributed Transaction Commit?

Summary: Systematic characterization of time and message complexity of atomic commit in the common case (failure-free, all-vote-yes) that closes open questions such as synchronous non-blocking bounds. Provides matching optimal protocols and an "indulgent atomic commit" scheme for practical mostly-synchronous systems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1716
Venue
PODS
Year
2017
Pagerank
4.6846408e-05
Overall Rank
7,666 | 46.67%
DOI
10.1145/3034786.3034799

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
390 CockroachDB: The Resilient Geo-Distributed SQL Database 2020 SIGMOD 0.00024607299
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers