{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:25:56Z","timestamp":1693866356176},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1016\/0196-6774(87)90049-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"536-556","source":"Crossref","is-referenced-by-count":9,"title":["The virtues of locking by symbolic names"],"prefix":"10.1016","volume":"8","author":[{"given":"Ouri","family":"Wolfson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(87)90049-6_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"issue":"1","key":"10.1016\/0196-6774(87)90049-6_BIB2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/320128.320131","article-title":"Concurrency control in a system for distributed databases (SDD1)","volume":"5","author":"Bernstein","year":"1980","journal-title":"ACM Trans. Database Systems Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(87)90049-6_BIB3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1145\/3149.3151","article-title":"Beyond two-phase locking","author":"Buckley","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/0196-6774(87)90049-6_BIB4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chvatal","year":"1979","journal-title":"Math. Oper. Res."},{"issue":"11","key":"10.1016\/0196-6774(87)90049-6_BIB5","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\/0196-6774(87)90049-6_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(87)90049-6_BIB7","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"4","key":"10.1016\/0196-6774(87)90049-6_BIB8","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/2157.322406","article-title":"Locking protocols: From exclusive to shared locks","volume":"30","author":"Kedem","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(87)90049-6_BIB9","series-title":"Proceedings, 11th Int. Conf. on VLDB","first-page":"270","article-title":"Pre-analysis locking: A safe and deadlock free locking policy","author":"Lausen","year":"1985"},{"issue":"1","key":"10.1016\/0196-6774(87)90049-6_BIB10","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\/0196-6774(87)90049-6_BIB11","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/TSE.1982.235885","article-title":"A family of locking protocols for database systems that are modeled by directed graphs","volume":"SE-8","author":"Silberschatz","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"1","key":"10.1016\/0196-6774(87)90049-6_BIB12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0196-6774(86)90043-X","article-title":"An algorithm for early unlocking of entities in database transactions","volume":"7","author":"Wolfson","year":"1986","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/0196-6774(87)90049-6_BIB13","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\/0196-6774(87)90049-6_BIB14","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\/0196-6774(87)90049-6_BIB15","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/TSE.1983.235107","article-title":"A case for non-two-phase-locking protocols that ensure atomicity","author":"Silberschatz","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(87)90049-6_BIB16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0022-0000(84)90078-3","article-title":"Is distributed locking harder?","volume":"28","author":"Kanellakis","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(87)90049-6_BIB17","series-title":"Proceedings, 1st Internat. Conf. on Data Engineering","first-page":"315","article-title":"Locking policies in distributed databases","author":"Wolfson","year":"1984"},{"key":"10.1016\/0196-6774(87)90049-6_BIB18","series-title":"Proceedings, 4th Principles of Database Systems Conf.","first-page":"105","article-title":"Deadlock freedom (and safety) of transactions in a distributed database","author":"Wolfson","year":"1985"},{"issue":"4","key":"10.1016\/0196-6774(87)90049-6_BIB19","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677487900496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:24:34Z","timestamp":1548725074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677487900496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0196677487900496"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(87)90049-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}