{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:17:34Z","timestamp":1649182654532},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0022-0000(90)90014-c","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"269-288","source":"Crossref","is-referenced-by-count":4,"title":["On the power of safe locking"],"prefix":"10.1016","volume":"40","author":[{"given":"Georg","family":"Lausen","sequence":"first","affiliation":[]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90014-C_BIB1","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","article-title":"The notions of consistency and predicate locks in a database system","volume":"19","author":"Eswaran","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(90)90014-C_BIB2","series-title":"Proceedings, 3rd ACM SIGACT-SIGMOD Symposium of Principles of Database Systems","first-page":"38","article-title":"Maximal Concurrency by Locking","author":"Lausen","year":"1984"},{"key":"10.1016\/0022-0000(90)90014-C_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0196-6774(81)90023-7","article-title":"A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems","volume":"2","author":"Lipski","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(90)90014-C_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0255(84)90025-2","article-title":"On the definition and computation of rectilinear convex hulls","volume":"33","author":"Ottmann","year":"1984","journal-title":"Inform. Sci."},{"key":"10.1016\/0022-0000(90)90014-C_BIB5","series-title":"Proceedings, Conf. on Theoretical Computer Science","first-page":"275","article-title":"Some computational problems related to database concurrency control","author":"Papadimitriou","year":"1977"},{"key":"10.1016\/0022-0000(90)90014-C_BIB6","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","article-title":"Serializability of concurrent updates","volume":"26","author":"Papadimitriou","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90014-C_BIB7","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1145\/322344.322349","article-title":"A theorem in database concurrency control","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90014-C_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1137\/0212013","article-title":"Concurrency control by locking","volume":"12","author":"Papadimitriou","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90014-C_BIB9","first-page":"750","article-title":"Correction to \u201cA theorem in database concurrency control\u201d","volume":"32","author":"Papadimitriou","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90014-C_BIB10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0196-6774(84)90027-0","article-title":"An optimal algorithm to compute the closure of a set of isorectangles","volume":"5","author":"Soisalon-Soininen","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(90)90014-C_BIB11","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322326.322333","article-title":"A theory of safe locking policies in database systems","volume":"29","author":"Yannakakis","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90014-C_BIB12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/62.322425","article-title":"Serializability by locking","volume":"31","author":"Yannakakis","year":"1984","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090014C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090014C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:55:31Z","timestamp":1550307331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090014C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["002200009090014C"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90014-c","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}