{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:45:59Z","timestamp":1648979159646},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":9786,"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":[[1986,10]]},"DOI":"10.1016\/0022-0000(86)90017-6","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"161-178","source":"Crossref","is-referenced-by-count":0,"title":["Deadlock-freedom (and safety) of transactions in a distributed database"],"prefix":"10.1016","volume":"33","author":[{"given":"Ouri","family":"Wolfson","sequence":"first","affiliation":[]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0022-0000(86)90017-6_BIB1","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":"ACM Comput. Surveys"},{"issue":"No. 11","key":"10.1016\/0022-0000(86)90017-6_BIB2","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","article-title":"The notion of consistency and predicate locks in a database system","volume":"19","author":"Eswaran","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(86)90017-6_BIB3","series-title":"Proc. 7th Int. Conf. on VLDB","first-page":"112","article-title":"A theory of correct locking protocols for database systems","author":"Fussel","year":"1981"},{"key":"10.1016\/0022-0000(86)90017-6_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(86)90017-6_BIB5","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0196-6774(83)90028-7","article-title":"The NP-completeness column: An ongoing guide (Number 8)","volume":"4","author":"Johnson","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(86)90017-6_BIB6","series-title":"Proc. 22nd IEEE Found. of Comput. Sci. Conference","first-page":"185","article-title":"The complexity of distributed concurrency control","author":"Kanellakis","year":"1981"},{"key":"10.1016\/0022-0000(86)90017-6_BIB7","series-title":"Proc. ACM Sympos on Principles of Database Systems","first-page":"98","article-title":"Is Distributed Locking Harder?","author":"Kanellakis","year":"1982"},{"key":"10.1016\/0022-0000(86)90017-6_BIB8","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 deadlocks in locked transaction systems","volume":"2","author":"Lipski","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(86)90017-6_BIB9","series-title":"Proc. of the ACM-SIGMOD Conf","first-page":"9","article-title":"Consistency, concurrency and crash recovery","author":"Lien","year":"1978"},{"issue":"No. 2","key":"10.1016\/0022-0000(86)90017-6_BIB10","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."},{"issue":"No. 4","key":"10.1016\/0022-0000(86)90017-6_BIB11","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","article-title":"The serializability of concurrent database updates","volume":"26","author":"Papadimitriou","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0022-0000(86)90017-6_BIB12","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1145\/320251.320260","article-title":"System Level Concurrency Control for Distributed Database Systems","volume":"3","author":"Rosenkrantz","year":"1978","journal-title":"ACM Trans, Database Systems"},{"issue":"1","key":"10.1016\/0022-0000(86)90017-6_BIB13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/322169.322176","article-title":"Consistency in hierarchical database systems","volume":"27","author":"Silberschatz","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(86)90017-6_BIB14","article-title":"On Deadlock Detection in Distributed and Centralized Locking","volume":"118","author":"Soisalon-Soininen","year":"1982"},{"key":"10.1016\/0022-0000(86)90017-6_BIB15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0196-6774(84)90027-0","article-title":"Optimal algorithms 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(86)90017-6_BIB16","series-title":"Proceedings, Symposium on Principles of Distributed Computing","first-page":"267","article-title":"Freedom from deadlock of locked transactions in a distributed database","author":"Tirri","year":"1983"},{"key":"10.1016\/0022-0000(86)90017-6_BIB17","series-title":"Principles of Database Systems","author":"Ullman","year":"1979"},{"key":"10.1016\/0022-0000(86)90017-6_BIB18","article-title":"Concurrency Control Using Locks in Distributed Databases","author":"Wolfson","year":"1984"},{"key":"10.1016\/0022-0000(86)90017-6_BIB19","doi-asserted-by":"crossref","unstructured":"O. Wolfson, An algorithm for early unlocking of entities in database transactions, J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(86)90043-X"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90017-6_BIB20","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(86)90017-6_BIB21","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0211031","article-title":"Freedom from deadlock of safe locking policies","volume":"11","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(86)90017-6_BIB22","series-title":"Proceedings, 20th Annual Sympos. on Found. Comput. Sci.","first-page":"286","article-title":"Locking policies: Safety and freedom from deadlock","author":"Yannakakis","year":"1979"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900176?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:53:01Z","timestamp":1550325181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000086900176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["0022000086900176"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(86)90017-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}