{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:33:10Z","timestamp":1649086390398},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":["Information Sciences"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0020-0255(89)90035-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"27-51","source":"Crossref","is-referenced-by-count":5,"title":["Operation-specific locking in balanced structures"],"prefix":"10.1016","volume":"48","author":[{"given":"Alexandros","family":"Biliris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0255(89)90035-2_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/0020-0255(89)90035-2_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","article-title":"Concurrency of operations on B-trees","volume":"9","author":"Bayer","year":"1977","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1145\/3149.3151","article-title":"Beyond two-phase locking","volume":"32","author":"Buckley","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB4","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":"3","key":"10.1016\/0020-0255(89)90035-2_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/TSE.1983.236732","article-title":"Analyzing concurrency control algorithms when user and system operations differ","volume":"SE-9","author":"Bernstein","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0255(89)90035-2_BIB6","article-title":"Concurrency control on Database Indexes: Design and Evaluation","author":"Biliris","year":"1985"},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB7_1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surveys"},{"issue":"4","key":"10.1016\/0020-0255(89)90035-2_BIB7_2","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/356789.356800","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0255(89)90035-2_BIB8","series-title":"Proceedings of the Second IEEE International Conference on Data Engineering","first-page":"49","article-title":"A dynamic tree-locking protocol","author":"Croker","year":"1986"},{"issue":"9","key":"10.1016\/0020-0255(89)90035-2_BIB9","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1109\/TC.1980.1675680","article-title":"Concurrent search and insertion in AVL trees","volume":"C-29","author":"Ellis","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0020-0255(89)90035-2_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289064","article-title":"Concurrent search and insertion in 2\u20133 trees","volume":"14","author":"Ellis","year":"1980","journal-title":"Acta Inform."},{"issue":"11","key":"10.1016\/0020-0255(89)90035-2_BIB11","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":"Eswaren","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(89)90035-2_BIB12","series-title":"Proceedings of the ACM SIGACT-SIGMOD Symposium on Principles of Database Systems","first-page":"51","article-title":"Concurrency control and the serializability of concurrent tree algorithms","author":"Ford","year":"1984"},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB13","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1145\/319983.319985","article-title":"Using semantic knowledge for transaction processing in a distributed database","volume":"8","author":"Garcia-Molina","year":"1983","journal-title":"ACM Trans. Database Systems"},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356842.356847","article-title":"The recovery manager of the System R database manager","volume":"13","author":"Gray","year":"1981","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0255(89)90035-2_BIB15","series-title":"Proceedings of the 19th Annual Symposium on the Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0020-0255(89)90035-2_BIB16","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"issue":"4","key":"10.1016\/0020-0255(89)90035-2_BIB17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/289.291","article-title":"Principles of transactions-oriented database recovery","volume":"15","author":"Haerder","year":"1983","journal-title":"ACM Comput. Surveys"},{"issue":"4","key":"10.1016\/0020-0255(89)90035-2_BIB18","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."},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/spe.4380140205","article-title":"Application of an optimistic concurrency control method","volume":"14","author":"Kersten","year":"1984","journal-title":"Software Practice and Experience"},{"issue":"3","key":"10.1016\/0020-0255(89)90035-2_BIB20","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/320613.320619","article-title":"A concurrent database manipulation problem: Binary search trees","volume":"5","author":"Kung","year":"1980","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/0020-0255(89)90035-2_BIB21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","article-title":"A new method for concurrency in B-trees","volume":"8","author":"Kwong","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"1","key":"10.1016\/0020-0255(89)90035-2_BIB22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02243072","article-title":"Integrated concurrency control in shared B-trees","volume":"33","author":"Lausen","year":"1984","journal-title":"Computing"},{"issue":"4","key":"10.1016\/0020-0255(89)90035-2_BIB23","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","article-title":"Efficient locking for concurrent operation on B-trees","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM Trans. Database Systems"},{"issue":"4","key":"10.1016\/0020-0255(89)90035-2_BIB24","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/319996.319999","article-title":"Multilevel atomicity\u2014a new correctness criterion for database concurrency control","volume":"8","author":"Lynch","year":"1983","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/0020-0255(89)90035-2_BIB25","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/1270.318576","article-title":"Concurrency control in a dynamic search structure","volume":"9","author":"Manber","year":"1984","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0020-0255(89)90035-2_BIB26","series-title":"Proceedings of the Symposium on Reliability in Distributed Software and Database Systems, Computer Science Press","first-page":"131","article-title":"Dynamic crash recovery of balanced trees","author":"Menasce","year":"1981"},{"key":"10.1016\/0020-0255(89)90035-2_BIB27","series-title":"Proceedings of the 12 th Annual Conference in Information Science and Systems","article-title":"Multiple access to B-trees","author":"Miller","year":"1978"},{"key":"10.1016\/0020-0255(89)90035-2_BIB28","series-title":"Proceedings of the 11th International Conference on Very Large Databases","first-page":"331","article-title":"Concurrency control in B+-tree databases using preparatory operations","author":"Mond","year":"1985"},{"key":"10.1016\/0020-0255(89)90035-2_BIB29","article-title":"Nested transactions: An approach to reliable distributed computing","author":"Moss","year":"1981"},{"key":"10.1016\/0020-0255(89)90035-2_BIB30","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","first-page":"72","article-title":"Abstraction in recovery management","author":"Moss","year":"1986"},{"key":"10.1016\/0020-0255(89)90035-2_BIB31","article-title":"Naming and synchronization in a decentralized computer System","author":"Reed","year":"1978"},{"issue":"4","key":"10.1016\/0020-0255(89)90035-2_BIB32","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(76)90005-3","article-title":"B-trees in a System with multiple users","volume":"5","author":"Samadi","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0255(89)90035-2_BIB33","series-title":"Proceedings of the 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems","first-page":"28","article-title":"Concurrent operations on B-trees with overtaking","author":"Sagiv","year":"1985"},{"issue":"2","key":"10.1016\/0020-0255(89)90035-2_BIB34","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1041478.1041481","article-title":"Transactions: A construct for reliable distributed computing","volume":"17","author":"Spector","year":"1983","journal-title":"Oper. Systems Rev."},{"issue":"6","key":"10.1016\/0020-0255(89)90035-2_BIB35","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/TSE.1985.232244","article-title":"Support for distributed transactions in the tabs prototype","volume":"SE-11","author":"Spector","year":"1985","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0255(89)90035-2_BIB36","series-title":"Proceedings of the 10th International Conference on Very Large Databases","first-page":"3","article-title":"Database portals: A new application program interface","author":"Stonebraker","year":"1984"},{"key":"10.1016\/0020-0255(89)90035-2_BIB37","series-title":"Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems","first-page":"31","article-title":"A theoretical foundation of multi-level concurrency control","author":"Weikum","year":"1986"},{"key":"10.1016\/0020-0255(89)90035-2_BIB38","series-title":"Proceedings of the 20th IEEE Symposium on Foundations of Computer Science","first-page":"286","article-title":"Locking policies: Safety and freedom from deadlock","author":"Yannakakis","year":"1979"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025589900352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025589900352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:21:31Z","timestamp":1552915291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025589900352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0020025589900352"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(89)90035-2","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}