{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:19Z","timestamp":1753894399115,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The popular isolation level Multiversion Read Committed (RC) trades some of\nthe strong guarantees of serializability for increased transaction throughput.\nSometimes, transaction workloads can be safely executed under RC obtaining\nserializability at the lower cost of RC. Such workloads are said to be robust\nagainst RC. Previous work has yielded a tractable procedure for deciding\nrobustness against RC for workloads generated by transaction programs modeled\nas transaction templates. An important insight of that work is that, by more\naccurately modeling transaction programs, we are able to recognize larger sets\nof workloads as robust. In this work, we increase the modeling power of\ntransaction templates by extending them with functional constraints, which are\nuseful for capturing data dependencies like foreign keys. We show that the\nincorporation of functional constraints can identify more workloads as robust\nthat otherwise would not be. Even though we establish that the robustness\nproblem becomes undecidable in its most general form, we show that various\nrestrictions on functional constraints lead to decidable and even tractable\nfragments that can be used to model and test for robustness against RC for\nrealistic scenarios.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:39)2023","type":"journal-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T18:55:10Z","timestamp":1703530510000},"source":"Crossref","is-referenced-by-count":0,"title":["Robustness against Read Committed for Transaction Templates with Functional Constraints"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Brecht","family":"Vandevoort","sequence":"first","affiliation":[]},{"given":"Bas","family":"Ketsman","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2023,12,25]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/12744\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/12744\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T18:55:11Z","timestamp":1703530511000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,25]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:39)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2201.05021v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2201.05021v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2201.05021","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2201.05021","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2023,12,25]]},"article-number":"10173"}}