{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T23:08:18Z","timestamp":1792710498661,"version":"4.5.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2006,3]]},"abstract":"<jats:p>\n                    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\n                    <jats:italic>F<\/jats:italic>\n                    + 1 coordinators and makes progress if at least\n                    <jats:italic>F<\/jats:italic>\n                    + 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\n                    <jats:italic>F<\/jats:italic>\n                    = 0 case of the Paxos Commit algorithm.\n                  <\/jats:p>","DOI":"10.1145\/1132863.1132867","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T10:14:26Z","timestamp":1153822466000},"page":"133-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":229,"title":["Consensus on transaction commit"],"prefix":"10.1145","volume":"31","author":[{"given":"Jim","family":"Gray","sequence":"first","affiliation":[{"name":"Microsoft Research, San Francisco, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie","family":"Lamport","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,3]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"DISC '01: Proceedings of the 15th International Conference on Distributed Computing, J. L. Welch, Ed. Lecture Notes in Computer Science","volume":"2180","author":"Aguilera M. K.","unstructured":"Aguilera , M. K. , Delporte-Gallet , C. , Fauconnier , H. , and Toueg , S . 2001. Stable leader election . In DISC '01: Proceedings of the 15th International Conference on Distributed Computing, J. L. Welch, Ed. Lecture Notes in Computer Science , vol. 2180 . Springer-Verlag, Berlin, Germany, 108--122. Aguilera, M. K., Delporte-Gallet, C., Fauconnier, H., and Toueg, S. 2001. Stable leader election. In DISC '01: Proceedings of the 15th International Conference on Distributed Computing, J. L. Welch, Ed. Lecture Notes in Computer Science, vol. 2180. Springer-Verlag, Berlin, Germany, 108--122."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"e_1_2_1_3_1","unstructured":"Bernstein P. A. Hadzilacos V. and Goodman N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley Reading MA.   Bernstein P. A. Hadzilacos V. and Goodman N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley Reading MA."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data","author":"Borr A. J.","year":"1981","unstructured":"Borr , A. J. 1981 . Transaction monitoring in encompass: Reliable distributed transaction processing . In Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data ( Ann Arbor, MI, April 29-May 1), Y. E. Lien, Ed. ACM Press, New York, NY, 155--165. Borr, A. J. 1981. Transaction monitoring in encompass: Reliable distributed transaction processing. In Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data (Ann Arbor, MI, April 29-May 1), Y. E. Lien, Ed. ACM Press, New York, NY, 155--165."},{"key":"e_1_2_1_5_1","unstructured":"Charron-Bost B. and Schiper A. 2000. Uniform consensus is harder than consensus (extended abstract). Tech. rep. DSC\/2000\/028. \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne Switzerland.  Charron-Bost B. and Schiper A. 2000. Uniform consensus is harder than consensus (extended abstract). Tech. rep. DSC\/2000\/028. \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne Switzerland."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97)","volume":"1320","author":"De Prisco R.","unstructured":"De Prisco , R. , Lampson , B. , and Lynch , N . 1997. Revisiting the Paxos algorithm . In Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97) , M. Mavronicolas and P. Tsigas, Eds. Lecture Notes in Computer Science , vol. 1320 . Springer-Verlag, Saarbruken, Germany, 111--125. De Prisco, R., Lampson, B., and Lynch, N. 1997. Revisiting the Paxos algorithm. In Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97), M. Mavronicolas and P. Tsigas, Eds. Lecture Notes in Computer Science, vol. 1320. Springer-Verlag, Saarbruken, Germany, 111--125."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_9_1","volume-title":"Operating Systems: An Advanced Course","author":"Gray J.","unstructured":"Gray , J. 1978. Notes on data base operating systems . In Operating Systems: An Advanced Course , R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Lecture Notes in Computer Science, vol. 60 . Springer-Verlag , Berlin, Heidelberg, Germany\/New York, NY, 393--481. Gray, J. 1978. Notes on data base operating systems. In Operating Systems: An Advanced Course, R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Lecture Notes in Computer Science, vol. 60. Springer-Verlag, Berlin, Heidelberg, Germany\/New York, NY, 393--481."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645952.675497"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press","author":"Guerraoui R.","unstructured":"Guerraoui , R. , Larrea , M. , and Schiper , A . 1996. Reducing the cost for nonblocking in atomic commitment . In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press , Los Alamitos, CA, 692--697. Guerraoui, R., Larrea, M., and Schiper, A. 1996. Reducing the cost for nonblocking in atomic commitment. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press, Los Alamitos, CA, 692--697."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_13_1","first-page":"4","article-title":"Paxos made simple","volume":"32","author":"Lamport L.","year":"2001","unstructured":"Lamport , L. 2001 . Paxos made simple . ACM SIGACT News (Distributed Computing Column) 32 , 4 (Dec.), 18--25. Lamport, L. 2001. Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Dec.), 18--25.","journal-title":"ACM SIGACT News (Distributed Computing Column)"},{"key":"e_1_2_1_14_1","volume-title":"Specifying Systems","author":"Lamport L.","unstructured":"Lamport , L. 2003. Specifying Systems . Addison-Wesley , Boston, MA . A link to an electronic copy can be found online at http:\/\/lamport.org. Lamport, L. 2003. Specifying Systems. Addison-Wesley, Boston, MA. A link to an electronic copy can be found online at http:\/\/lamport.org."},{"key":"e_1_2_1_15_1","series-title":"Lecture Notes in Computer Science","volume-title":"How to build a highly available system using consensus","author":"Lampson B. W.","unstructured":"Lampson , B. W. 1996. How to build a highly available system using consensus . In Distributed Algorithms, O. Babaoglu and K. Marzullo, Eds. Lecture Notes in Computer Science , vol. 1151 . Springer-Verlag, Berlin , Germany , 1--17. Lampson, B. W. 1996. How to build a highly available system using consensus. In Distributed Algorithms, O. Babaoglu and K. Marzullo, Eds. Lecture Notes in Computer Science, vol. 1151. Springer-Verlag, Berlin, Germany, 1--17."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806712"},{"key":"e_1_2_1_17_1","volume-title":"Understanding Web Services","author":"Newcomer E.","unstructured":"Newcomer , E. 2002. Understanding Web Services . Addison-Wesley , Boston, MA . Newcomer, E. 2002. Understanding Web Services. Addison-Wesley, Boston, MA."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582339"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132863.1132867","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132863.1132867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:13Z","timestamp":1750244773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132863.1132867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1145\/1132863.1132867"],"URL":"https:\/\/doi.org\/10.1145\/1132863.1132867","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]},"assertion":[{"value":"2006-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}