{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:44:44Z","timestamp":1757616284539,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":4505,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0022-0000(93)90020-w","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"45-76","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":37,"title":["B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half"],"prefix":"10.1016","volume":"47","author":[{"given":"Theodore","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90020-W_BIB1","article-title":"Expected behavior of B+-trees under random inserts","volume":"27","author":"Baeza-Yates","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(93)90020-W_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/69.87964","article-title":"Performance of B+-trees with partial expansions","volume":"1","author":"Baeza-Yates","year":"1989","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"issue":"No. 3","key":"10.1016\/0022-0000(93)90020-W_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indices","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(93)90020-W_BIB4","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."},{"key":"10.1016\/0022-0000(93)90020-W_BIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(87)90029-9","article-title":"Modeling B-tree insertion activity","volume":"26","author":"Driscoll","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90020-W_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","article-title":"The theory of fringe analysis and its applications to 2\u20133 trees and B-trees","volume":"55","author":"Eisenbarth","year":"1982","journal-title":"Inform. and Control."},{"key":"10.1016\/0022-0000(93)90020-W_BIB7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(86)90101-8","article-title":"Approximate storage utilization of B-trees","volume":"22","author":"Gupta","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90020-W_BIB8","unstructured":"NAG (USA) Inc., NAG 1131 Warren Ave., Downers Grove, IL 60515."},{"issue":"No. 4","key":"10.1016\/0022-0000(93)90020-W_BIB9","first-page":"35","article-title":"Storage utilization in B\u2217-trees with a generalized overflow technique","volume":"19","author":"Kuspert","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(93)90020-W_BIB10","series-title":"ACM-NCC","first-page":"35","article-title":"An efficient model for representing and analyzing B-trees","author":"Langenhop","year":"1985"},{"key":"10.1016\/0022-0000(93)90020-W_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(84)90085-1","article-title":"Approximate storage utilization of B-trees. A simple derivation and generalizations","volume":"19","author":"Leung","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90020-W_BIB12","series-title":"Allerton Conference","first-page":"265","article-title":"On the required space for random split trees","author":"Mizoguchi","year":"1979"},{"key":"10.1016\/0022-0000(93)90020-W_BIB13","series-title":"Research Report RJ 6864","article-title":"ARIES\/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes","author":"Mohan","year":"1989"},{"article-title":"ARIES\/IM: An efficient and high concurrency index management method using write-ahead logging","year":"1989","author":"Mohan","key":"10.1016\/0022-0000(93)90020-W_BIB14"},{"key":"10.1016\/0022-0000(93)90020-W_BIB15","series-title":"4th International Conference on Very Large Databases","first-page":"489","article-title":"An analysis of storage utilization in block split, data structuring scheme","author":"Nakamura","year":"1978"},{"key":"10.1016\/0022-0000(93)90020-W_BIB16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0306-4379(80)90064-2","article-title":"Space utilizations and access path length in B-trees","volume":"5","author":"Quitzow","year":"1980","journal-title":"Inform. System"},{"key":"10.1016\/0022-0000(93)90020-W_BIB17","series-title":"Database Management","first-page":"385","article-title":"On the selection of access paths in a data base system","author":"Wedekind","year":"1974"},{"key":"10.1016\/0022-0000(93)90020-W_BIB18","article-title":"Some average performance measures for the B-tree","volume":"16","author":"Wright","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(93)90020-W_BIB19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","article-title":"On random 2\u20133 trees","volume":"89","author":"Yao","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(93)90020-W_BIB20","unstructured":"B. Zhang and M. Hsu, Unsafe operations in B-trees, Acta Inform., to appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390020W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390020W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:55Z","timestamp":1757095855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390020W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002200009390020W"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90020-w","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1993,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(93)90020-W","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}