{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:20Z","timestamp":1761611120280},"reference-count":14,"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)90021-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"275-296","source":"Crossref","is-referenced-by-count":87,"title":["Concurrent operations on B\u2217-trees with overtaking"],"prefix":"10.1016","volume":"33","author":[{"given":"Yehoshua","family":"Sagiv","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(86)90021-8_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."},{"key":"10.1016\/0022-0000(86)90021-8_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":"No. 1","key":"10.1016\/0022-0000(86)90021-8_BIB3","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."},{"key":"10.1016\/0022-0000(86)90021-8_BIB4","series-title":"Proceedings, 2nd ACM SIGACT-SIGMOD Sympos. on Principles of Database Systems","first-page":"106","article-title":"Extendible hashing for concurrent operations and distributed data","author":"Ellis","year":"1983"},{"key":"10.1016\/0022-0000(86)90021-8_BIB5","series-title":"Proceedings, 19th Annu. Sympos. Found. of Comput. Sci.","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90021-8_BIB6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","article-title":"Concurrent manipulation of binary search trees","volume":"5","author":"Kung","year":"1980","journal-title":"ACM Trans. Database Systems"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90021-8_BIB7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","article-title":"A new method for concurrency in B-trees","volume":"SE-8","author":"Kwong","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"No. 4","key":"10.1016\/0022-0000(86)90021-8_BIB8","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","article-title":"Efficient locking for concurrent operations on B-trees","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM Trans. Database Systems"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90021-8_BIB9","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\/0022-0000(86)90021-8_BIB10","series-title":"Proc. Conf. Inform. Sci. and Systems","article-title":"Multiple access to B-trees","author":"Miller","year":"1978"},{"key":"10.1016\/0022-0000(86)90021-8_BIB11","article-title":"Restructuring the Lehman-Yao Tree","author":"Salzberg","year":"1985"},{"issue":"No. 4","key":"10.1016\/0022-0000(86)90021-8_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(76)90005-3","article-title":"B-trees in system with multiple users","volume":"5","author":"Samadi","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(86)90021-8_BIB13","series-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"key":"10.1016\/0022-0000(86)90021-8_BIB14","series-title":"Data base Management","first-page":"385","article-title":"On the selection of access paths in a data base systems","author":"Wedekind","year":"1974"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900218?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:52:57Z","timestamp":1550307177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000086900218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["0022000086900218"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(86)90021-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}