{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T23:10:44Z","timestamp":1721085044947},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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 Systems"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0306-4379(89)90001-x","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"359-370","source":"Crossref","is-referenced-by-count":9,"title":["An analysis of B-trees and their variants"],"prefix":"10.1016","volume":"14","author":[{"given":"Chu","family":"Jiang-Hsing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary D","family":"Knott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0306-4379(89)90001-X_BIB1_1","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 Informatica"},{"key":"10.1016\/0306-4379(89)90001-X_BIB1_2","author":"Bayer","year":"1970"},{"key":"10.1016\/0306-4379(89)90001-X_BIB1_3","series-title":"Record of 1970 ACM SICFIDET Workshop on Data Description and Access (B-trees)","first-page":"107","author":"Bayer","year":"1971"},{"issue":"1\u20133","key":"10.1016\/0306-4379(89)90001-X_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","article-title":"The theory of fringe analysis and its application to 2\u20133 Trees and B-trees","volume":"55","author":"Eisenbarth","year":"1982","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/0306-4379(89)90001-X_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00263927","article-title":"Storage utilization in B\u2217+-trees with a generalized overflow technique","volume":"19","author":"K\u00fcspert","year":"1983","journal-title":"Acta Informatica"},{"key":"10.1016\/0306-4379(89)90001-X_BIB4","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 generalisations","volume":"19","author":"Leung","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0306-4379(89)90001-X_BIB5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0306-4379(80)90064-2","article-title":"Space utilization and access path length in B-trees","volume":"5","author":"Quitzow","year":"1980","journal-title":"Inform. Systems"},{"issue":"1","key":"10.1016\/0306-4379(89)90001-X_BIB6","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/BF00289710","article-title":"Some average performance measures for the B-tree","volume":"21","author":"Wright","year":"1985","journal-title":"Acta Informatica"},{"issue":"2","key":"10.1016\/0306-4379(89)90001-X_BIB7_1","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/BF00289075","article-title":"On random 2,3-trees","volume":"9","author":"Yao","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/0306-4379(89)90001-X_BIB7_2","author":"Yao","year":"1974"},{"issue":"11","key":"10.1016\/0306-4379(89)90001-X_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"1","author":"Comer","year":"1979","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0306-4379(89)90001-X_BIB9","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(89)90001-X_BIB10","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(89)90001-X_BIB11","article-title":"The expected behaviour of B+-trees","author":"Baeza-Yates","year":"1987"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643798990001X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643798990001X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:54:08Z","timestamp":1552611248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030643798990001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["030643798990001X"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(89)90001-x","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}