{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:58Z","timestamp":1750219858622,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2023,6,7]]},"abstract":"<jats:p>The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing serializability at a reduced cost. Such workloads are said to be robust against RC. This paper provides a high level overview of deciding robustness against RC. In particular, we discuss how a sound and complete test can be obtained through the formalization of transaction templates. We then increase the modeling power of transaction templates by extending them with functional constraints which are useful for capturing data dependencies like foreign keys. We show that the incorporation of functional constraints can identify more workloads as robust than would otherwise be the case. Even though the robustness problem becomes undecidable in its most general form, we establish that various restrictions on functional constraints lead to decidable and even tractable results that can be used to model and test for robustness against RC for practical scenarios.<\/jats:p>","DOI":"10.1145\/3604437.3604446","type":"journal-article","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T22:22:01Z","timestamp":1686262921000},"page":"36-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["When is it safe to run a transactional workload under Read Committed?"],"prefix":"10.1145","volume":"52","author":[{"given":"Brecht","family":"Vandevoort","sequence":"first","affiliation":[{"name":"UHasselt, Data Science Institute, ACSL"}]},{"given":"Bas","family":"Ketsman","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel"}]},{"given":"Christoph","family":"Koch","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne"}]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[{"name":"UHasselt, Data Science Institute, ACSL"}]}],"member":"320","published-online":{"date-parts":[[2023,6,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497466"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2015.7507103"},{"key":"e_1_2_1_3_1","first-page":"286","volume-title":"CAV","author":"Beillahi S. M.","year":"2019","unstructured":"S. M. Beillahi , A. Bouajjani , and C. Enea . Checking robustness against snapshot isolation . In CAV , pages 286 -- 304 , 2019 . S. M. Beillahi, A. Bouajjani, and C. Enea. Checking robustness against snapshot isolation. In CAV, pages 286--304, 2019."},{"key":"e_1_2_1_4_1","first-page":"1","volume-title":"CONCUR","author":"Beillahi S. M.","year":"2019","unstructured":"S. M. Beillahi , A. Bouajjani , and C. Enea . Robustness against transactional causal consistency . In CONCUR , pages 1 -- 18 , 2019 . S. M. Beillahi, A. Bouajjani, and C. Enea. Robustness against transactional causal consistency. In CONCUR, pages 1--18, 2019."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223785"},{"key":"e_1_2_1_6_1","first-page":"1","volume-title":"CONCUR","author":"Bernardi G.","year":"2016","unstructured":"G. Bernardi and A. Gotsman . Robustness against consistency models with atomic visibility . In CONCUR , pages 7: 1 -- 7 :15, 2016 . G. Bernardi and A. Gotsman. Robustness against consistency models with atomic visibility. In CONCUR, pages 7:1--7:15, 2016."},{"key":"e_1_2_1_7_1","first-page":"58","volume-title":"CONCUR","author":"Cerone A.","year":"2015","unstructured":"A. Cerone , G. Bernardi , and A. Gotsman . A framework for transactional consistency models with atomic visibility . In CONCUR , pages 58 -- 71 , 2015 . A. Cerone, G. Bernardi, and A. Gotsman. A framework for transactional consistency models with atomic visibility. In CONCUR, pages 58--71, 2015."},{"key":"e_1_2_1_8_1","first-page":"1","volume-title":"CONCUR","author":"Cerone A.","year":"2017","unstructured":"A. Cerone , A. Gotsman , and H. Yang . Algebraic Laws for Weak Consistency . In CONCUR , pages 26: 1 -- 26 :18, 2017 . A. Cerone, A. Gotsman, and H. Yang. Algebraic Laws for Weak Consistency. In CONCUR, pages 26:1--26:18, 2017."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065193"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071615"},{"issue":"11","key":"e_1_2_1_11_1","first-page":"2773","article-title":"Isodiff: Debugging anomalies caused by weak isolation","volume":"13","author":"Gan Y.","year":"2020","unstructured":"Y. Gan , X. Ren , D. Ripberger , S. Blanas , and Y. Wang . Isodiff: Debugging anomalies caused by weak isolation . PVLDB , 13 ( 11 ): 2773 -- 2786 , 2020 . Y. Gan, X. Ren, D. Ripberger, S. Blanas, and Y. Wang. Isodiff: Debugging anomalies caused by weak isolation. PVLDB, 13(11):2773--2786, 2020.","journal-title":"PVLDB"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387655"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582302.3582304"},{"key":"e_1_2_1_14_1","volume-title":"The Theory of Database Concurrency Control","author":"Papadimitriou C. H.","year":"1986","unstructured":"C. H. Papadimitriou . The Theory of Database Concurrency Control . Computer Science Press , 1986 . C. H. Papadimitriou. The Theory of Database Concurrency Control. Computer Science Press, 1986."},{"key":"e_1_2_1_15_1","first-page":"264","volume-title":"Bull. Amer. Math. Soc.","author":"Post E. L.","year":"1946","unstructured":"E. L. Post . A variant of a recursively unsolvable problem . Bull. Amer. Math. Soc. , pages 264 -- 268 , 1946 . E. L. Post. A variant of a recursively unsolvable problem. Bull. Amer. Math. Soc., pages 264--268, 1946."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476268"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517804.3524162"},{"key":"e_1_2_1_18_1","series-title":"LIPIcs","first-page":"1","volume-title":"ICDT","author":"Vandevoort B.","year":"2022","unstructured":"B. Vandevoort , B. Ketsman , C. Koch , and F. Neven . Robustness against read committed for transaction templates with functional constraints . In ICDT , volume 220 of LIPIcs , pages 16: 1 -- 16 :17, 2022 . B. Vandevoort, B. Ketsman, C. Koch, and F. Neven. Robustness against read committed for transaction templates with functional constraints. In ICDT, volume 220 of LIPIcs, pages 16:1--16:17, 2022."},{"key":"e_1_2_1_19_1","volume-title":"Robustness against read committed for transaction templates with functional constraints (full version). https:\/\/arxiv.org\/abs\/2201.05021","author":"Vandevoort B.","year":"2022","unstructured":"B. Vandevoort , B. Ketsman , C. Koch , and F. Neven . Robustness against read committed for transaction templates with functional constraints (full version). https:\/\/arxiv.org\/abs\/2201.05021 , 2022 . B. Vandevoort, B. Ketsman, C. Koch, and F. Neven. Robustness against read committed for transaction templates with functional constraints (full version). https:\/\/arxiv.org\/abs\/2201.05021, 2022."},{"key":"e_1_2_1_20_1","volume-title":"Detecting robustness against MVRC for transaction programs with predicate reads. To appear in EDBT","author":"Vandevoort B.","year":"2023","unstructured":"B. Vandevoort , B. Ketsman , C. Koch , and F. Neven . Detecting robustness against MVRC for transaction programs with predicate reads. To appear in EDBT , 2023 . B. Vandevoort, B. Ketsman, C. Koch, and F. Neven. Detecting robustness against MVRC for transaction programs with predicate reads. To appear in EDBT, 2023."},{"key":"e_1_2_1_21_1","volume-title":"Manuscript","author":"Vandevoort B.","year":"2022","unstructured":"B. Vandevoort , B. Ketsman , and F. Neven . Allocating isolation levels to transactions in a multiversion setting . Manuscript , 2022 B. Vandevoort, B. Ketsman, and F. Neven. Allocating isolation levels to transactions in a multiversion setting. Manuscript, 2022"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604437.3604446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604437.3604446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:18Z","timestamp":1750178838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604437.3604446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6,7]]}},"alternative-id":["10.1145\/3604437.3604446"],"URL":"https:\/\/doi.org\/10.1145\/3604437.3604446","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"2023-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}