{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:59:35Z","timestamp":1775822375014,"version":"3.50.1"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Data storage in the Cloud needs to be scalable and fault-tolerant. Atomic commitment protocols such as Two Phase Commit (2PC) provide ACID guarantees for transactional access to sharded data and help in achieving scalability. Whereas consensus protocols such as Paxos consistently replicate data across different servers and provide fault tolerance. Cloud based datacenters today typically treat the problems of scalability and fault-tolerance disjointedly. In this work, we propose a unification of these two different paradigms into one framework called Consensus and Commitment (C&amp;C) framework. The C&amp;C framework can model existing and well known data management protocols as well as propose new ones. We demonstrate the advantages of the C&amp;C framework by developing a new atomic commitment protocol, Paxos Atomic Commit (PAC), which integrates commitment with recovery in a Paxos-like manner. We also instantiate commit protocols from the C&amp;C framework catered to different Cloud data management techniques. In particular, we propose a novel protocol, Generalized PAC (G-PAC) that integrates atomic commitment and fault tolerance in a cloud paradigm involving both sharding and replication of data. We compare the performance of G-PAC with a Spanner-like protocol, where 2PC is used at the logical data level and Paxos is used for consistent replication of logical data. The experimental results highlight the benefits of combining consensus along with commitment into a single integrated protocol.<\/jats:p>","DOI":"10.14778\/3303753.3303765","type":"journal-article","created":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T14:57:56Z","timestamp":1551279476000},"page":"611-623","source":"Crossref","is-referenced-by-count":22,"title":["Unifying consensus and atomic commitment for effective cloud data management"],"prefix":"10.14778","volume":"12","author":[{"given":"Sujaya","family":"Maiyya","sequence":"first","affiliation":[{"name":"UC Santa Barbara"}]},{"given":"Faisal","family":"Nawab","sequence":"additional","affiliation":[{"name":"UC Santa Cruz"}]},{"given":"Divyakant","family":"Agrawal","sequence":"additional","affiliation":[{"name":"UC Santa Barbara"}]},{"given":"Amr El","family":"Abbadi","sequence":"additional","affiliation":[{"name":"UC Santa Barbara"}]}],"member":"320","published-online":{"date-parts":[[2019,1]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Concurrency control and recovery in database systems","author":"Bernstein P. A.","year":"1987","unstructured":"P. A. Bernstein , V. Hadzilacos , and N. Goodman . Concurrency control and recovery in database systems . Addison-Wesley Pub . Co. Inc., Reading, MA, 1987 . P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley Pub. Co. Inc., Reading, MA, 1987."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1809315.1809323"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491245"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043559"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132867"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08755-9_9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645952.675497"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/106729.106745"},{"key":"e_1_2_1_12_1","volume-title":"Flexible paxos: Quorum intersection revisited. arXiv preprint arXiv:1608.06696","author":"Howard H.","year":"2016","unstructured":"H. Howard , D. Malkhi , and A. Spiegelman . Flexible paxos: Quorum intersection revisited. arXiv preprint arXiv:1608.06696 , 2016 . H. Howard, D. Malkhi, and A. Spiegelman. Flexible paxos: Quorum intersection revisited. arXiv preprint arXiv:1608.06696, 2016."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/212433.212468"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465363"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"issue":"4","key":"e_1_2_1_16_1","first-page":"18","volume":"32","author":"Lamport L.","year":"2001","unstructured":"L. Lamport ACM Sigact News , 32 ( 4 ): 18 -- 25 , 2001 . L. Lamport et al. Paxos made simple. ACM Sigact News, 32(4):18--25, 2001.","journal-title":"ACM Sigact News"},{"key":"e_1_2_1_17_1","volume-title":"TechReport","author":"Lamport L.","year":"2008","unstructured":"L. Lamport , D. Malkhi , and L. Zhou . Stoppable paxos . TechReport , Microsoft Research , 2008 . L. Lamport, D. Malkhi, and L. Zhou. Stoppable paxos. TechReport, Microsoft Research, 2008."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582783"},{"key":"e_1_2_1_19_1","first-page":"630","volume":"93","author":"Lampson B.","year":"1993","unstructured":"B. Lampson and D. B. Lomet . A new presumed commit optimization for two phase commit. In VLDB , volume 93 , pages 630 -- 640 , 1993 . B. Lampson and D. B. Lomet. A new presumed commit optimization for two phase commit. In VLDB, volume 93, pages 630--640, 1993.","journal-title":"In VLDB"},{"key":"e_1_2_1_20_1","volume-title":"Xerox PARC Research Report","author":"Lampson B.","year":"1976","unstructured":"B. Lampson and H. Sturgis . Crash recovery in a distributed system. Technical report , Xerox PARC Research Report , 1976 . B. Lampson and H. Sturgis. Crash recovery in a distributed system. Technical report, Xerox PARC Research Report, 1976."},{"key":"e_1_2_1_21_1","author":"Lindsay B.","year":"1979","unstructured":"B. Lindsay , P. Selinger , C. Galtieri , J. Gray , R. Lorie , T. Price , F. Putzolu , and B. W. Wade . Notes on distributed databases. Thomas J. Watson IBM Research Center , 1979 . B. Lindsay, P. Selinger, C. Galtieri, J. Gray, R. Lorie, T. Price, F. Putzolu, and B. W. Wade. Notes on distributed databases. Thomas J. Watson IBM Research Center, 1979.","journal-title":"Notes on distributed databases. Thomas J. Watson IBM Research Center"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536366"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806712"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2517350"},{"key":"e_1_2_1_25_1","first-page":"517","volume-title":"OSDI","author":"Mu S.","year":"2016","unstructured":"S. Mu , L. Nelson , W. Lloyd , and J. Li . Consolidating concurrency control and consensus for commits under conflicts . In OSDI , pages 517 -- 532 , 2016 . S. Mu, L. Nelson, W. Lloyd, and J. Li. Consolidating concurrency control and consensus for commits under conflicts. In OSDI, pages 517--532, 2016."},{"key":"e_1_2_1_26_1","first-page":"305","volume-title":"USENIX Annual Technical Conference","author":"Ongaro D.","year":"2014","unstructured":"D. Ongaro and J. K. Ousterhout . In search of an understandable consensus algorithm . In USENIX Annual Technical Conference , pages 305 -- 319 , 2014 . D. Ongaro and J. K. Ousterhout. In search of an understandable consensus algorithm. In USENIX Annual Technical Conference, pages 305--319, 2014."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582339"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.236608"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/320071.320076"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_2_1_31_1","volume-title":"Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery","author":"Weikum G.","year":"2001","unstructured":"G. Weikum and G. Vossen . Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery . Elsevier , 2001 . G. Weikum and G. Vossen. Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Elsevier, 2001."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815404"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3303753.3303765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:28:58Z","timestamp":1672219738000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3303753.3303765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.14778\/3303753.3303765"],"URL":"https:\/\/doi.org\/10.14778\/3303753.3303765","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}