{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:31:31Z","timestamp":1673483491004},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":[[1986,3]]},"DOI":"10.1016\/0196-6774(86)90043-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"146-156","source":"Crossref","is-referenced-by-count":9,"title":["An algorithm for early unlocking of entities in database transactions"],"prefix":"10.1016","volume":"7","author":[{"given":"Ouri","family":"Wolfson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(86)90043-X_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"issue":"No. 3","key":"10.1016\/0196-6774(86)90043-X_BIB2","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":"No. 11","key":"10.1016\/0196-6774(86)90043-X_BIB3","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(86)90043-X_BIB4","series-title":"Proc. 7th Int. Conf. on Very Large Databases","first-page":"112","article-title":"A theory of correct locking protocols for database systems","author":"Fussel","year":"1981"},{"key":"10.1016\/0196-6774(86)90043-X_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(86)90043-X_BIB6","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0196-6774(86)90043-X_BIB7","series-title":"Proc. 20th IEEE Sympos. Found. of Comput. Sci.","first-page":"274","article-title":"Controlling concurrency using locking protocols","author":"Kedem","year":"1979"},{"key":"10.1016\/0196-6774(86)90043-X_BIB8","series-title":"Proc. Internat. Conf. Very Large Databases","article-title":"Non-two-phase locking protocols with shared and exclusive locks","author":"Kedem","year":"1980"},{"issue":"No. 1","key":"10.1016\/0196-6774(86)90043-X_BIB9","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(86)90043-X_BIB10","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","author":"Silberschatz","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(86)90043-X_BIB11","series-title":"Proc. 1st IEEE-COMPDEC Conf. on Data Engineering","first-page":"315","article-title":"Locking policies in distributed databases","author":"Wolfson","year":"1984"},{"issue":"No. 3","key":"10.1016\/0196-6774(86)90043-X_BIB12","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(86)90043-X_BIB13","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(86)90043-X_BIB14","series-title":"Proc. of the 20th Annu. Sympos. Found. of Comput. Sci.","first-page":"286","article-title":"Locking policies: Safety and freedom deadlock","author":"Yannakakis","year":"1979"},{"key":"10.1016\/0196-6774(86)90043-X_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."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748690043X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748690043X?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:25:44Z","timestamp":1548725144000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748690043X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["019667748690043X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(86)90043-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}