{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:18:04Z","timestamp":1703186284903},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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 Processing Letters"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90101-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"243-246","source":"Crossref","is-referenced-by-count":6,"title":["Approximate storage utilization of B-trees"],"prefix":"10.1016","volume":"22","author":[{"given":"G.K.","family":"Gupta","sequence":"first","affiliation":[]},{"given":"B.","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90101-8_BIB1","volume":"Vol. 1","author":"Knuth","year":"1981"},{"key":"10.1016\/0020-0190(86)90101-8_BIB2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"key":"10.1016\/0020-0190(86)90101-8_BIB3","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\/0020-0190(86)90101-8_BIB4","series-title":"Proc. VLDB Conf.","first-page":"489","article-title":"An analysis of storage utilization factor in block split data structuring scheme","author":"Nakamura","year":"1978"},{"key":"10.1016\/0020-0190(86)90101-8_BIB5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0306-4379(80)90064-2","article-title":"Space utilization and access path lengths in B-trees","volume":"5","author":"Quitzow","year":"1980","journal-title":"Inform. Systems"},{"key":"10.1016\/0020-0190(86)90101-8_BIB6","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/0020-0190(86)90101-8_BIB7","series-title":"Proc. 18th Allerton Conf.","first-page":"233","article-title":"Average performance of the B-tree","author":"Wright","year":"1980"},{"key":"10.1016\/0020-0190(86)90101-8_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","article-title":"On random 2\u20133 trees","volume":"9","author":"Yao","year":"1978","journal-title":"Acta Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:29:40Z","timestamp":1553592580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086901018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086901018"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90101-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}