The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Consensus on transaction commit
Open accessAbstract
The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The classic Two-Phase Commit protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms also reach agreement, but do not block whenever any majority of the processes are working. The Paxos Commit algorithm runs a Paxos consensus algorithm on the commit/abort decision of each participant to obtain a transaction commit protocol that uses 2 F + 1 coordinators and makes progress if at least F + 1 of them are working properly. Paxos Commit has the same stable-storage write delay, and can be implemented to have the same message delay in the fault-free case as Two-Phase Commit, but it uses more messages. The classic Two-Phase Commit algorithm is obtained as the special F = 0 case of the Paxos Commit algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Self-citationReaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Self-citationConsensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
Notes on data base operating systems
Gray, J. N. (1978) · Lecture Notes in Computer Science · doi:10.1007/3-540-08755-9_9 · Cited by 1,656
Self-citationLamport, L. (2001) · Cited by 1,325
Self-citationAlpern, B., & Schneider, F. B. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90056-0 · Cited by 1,038
Cited by
The Future Renewable Electric Energy Delivery and Management (FREEDM) System: The Energy Internet
Huang, A. Q., Crow, M. L., Heydt, G. T., Zheng, J. P., & Dale, S. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2081330 · Cited by 1,463
Spanner: Google's globally-distributed database
Corbett, J. C., Dean, J. B., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2012) · doi:10.5555/2387880.2387905 · Cited by 807
Spanner: Google’s Globally Distributed Database
Corbett, J. C., Dean, J., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2491245 · Cited by 729
Chainspace: A Sharded Smart Contracts Platform
Al-Bassam, M., Sonnino, A., Bano, S., Hrycyszyn, D., & Danezis, G. (2018) · Proceedings 2018 Network and Distributed System Security Symposium · doi:10.14722/ndss.2018.23241 · Cited by 359
Corbett, J. C., Hochschild, P., Hsieh, W. C., Kanthak, S., Kogan, E., Li, H., Lloyd, A., Melnik, S., Mwaura, D., Nagle, D. F., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2518037.2491245 · Cited by 331
Metadata
- Authors
- Gray, J., & Lamport, L.
- Venue
- ACM Transactions on Database Systems
- Published
- 2006-03
- Volume
- 31
- Issue
- 1
- Pages
- 133-160
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2114407468
- Cited by
- 346
- References
- 8
- FWCI
- 35.04
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Consensus on transaction commit. https://app.cochat.ai/papers/10.1145/1132863.1132867
- The paper
- Gray, J., & Lamport, L. (2006). Consensus on transaction commit. ACM Transactions on Database Systems. https://doi.org/10.1145/1132863.1132867
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.