{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:13Z","timestamp":1747548313278},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8325,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0304-3975(90)90013-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"93-114","source":"Crossref","is-referenced-by-count":2,"title":["Parallel update transactions"],"prefix":"10.1016","volume":"76","author":[{"given":"Dino","family":"Karabeg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90013-8_BIB1","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/42267.42271","article-title":"Equivalence and optimization of relational transactions","volume":"35","author":"Abiteboul","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90013-8_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/356842.356846","article-title":"Concurrency control in distributed database systems","volume":"13","author":"Bernstein","year":"1981","journal-title":"Comput. Surv."},{"key":"10.1016\/0304-3975(90)90013-8_BIB3","series-title":"A Guide to DB2","author":"Date","year":"1984"},{"key":"10.1016\/0304-3975(90)90013-8_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(90)90013-8_BIB5","first-page":"254","article-title":"Axiomatization and simplification rules for relational transactions","author":"Karabeg","year":"1987","journal-title":"Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems"},{"key":"10.1016\/0304-3975(90)90013-8_BIB6","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/0304-3975(90)90013-8_BIB7","first-page":"275","article-title":"Computational problems related to database concurrency control","author":"Papadimitriou","year":"1977","journal-title":"Proc. Conf. on Theoretical Computer Science"},{"key":"10.1016\/0304-3975(90)90013-8_BIB8","series-title":"Principles of Database Systems","author":"Ullman","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590900138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590900138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:21:12Z","timestamp":1555179672000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397590900138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0304397590900138"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90013-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}