{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:57Z","timestamp":1750220577742,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T00:00:00Z","timestamp":1599177600000},"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":[[2020,9,4]]},"abstract":"<jats:p>Never make a promise - you may have to keep it. - Neil Jordan<\/jats:p>\n          <jats:p>Database systems were known to provide strong consistency guarantees. As an example, database textbook defines the ACID guarantees as \"four important properties of transactions to maintain data in the face of concurrent access and system failures\" [2]. Beyond atomicity, consistency, and durability, the \"I\" in ACID is loosely defined as \"Users should be able to understand a transaction without considering the effects of other concurrently executing transactions, even if the DBMS interleaves the actions of several transactions for performance reasons\" [2]. In the resulting model called serializable execution, each transaction operates like it has the database to itself, and the result of running a set of transactions is equivalent to some serial execution of these transactions.<\/jats:p>","DOI":"10.1145\/3422648.3422650","type":"journal-article","created":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T10:09:28Z","timestamp":1599214168000},"page":"6-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Technical Perspective"],"prefix":"10.1145","volume":"49","author":[{"given":"Johannes","family":"Gehrke","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,9,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735509"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/560733"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422648.3422650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3422648.3422650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:29Z","timestamp":1750195889000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422648.3422650"}},"subtitle":["Checking Invariant Confluence, In Whole or In Parts"],"short-title":[],"issued":{"date-parts":[[2020,9,4]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9,4]]}},"alternative-id":["10.1145\/3422648.3422650"],"URL":"https:\/\/doi.org\/10.1145\/3422648.3422650","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2020,9,4]]},"assertion":[{"value":"2020-09-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}