{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:54:03Z","timestamp":1649012043776},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996,1]]},"DOI":"10.1016\/0020-0190(95)00189-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"53-58","source":"Crossref","is-referenced-by-count":1,"title":["A uniform model for the storage utilization of B-tree-like structures"],"prefix":"10.1016","volume":"57","author":[{"given":"Donatella","family":"Merlini","sequence":"first","affiliation":[]},{"given":"Renzo","family":"Sprugnoli","sequence":"additional","affiliation":[]},{"given":"M.Cecilia","family":"Verri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00189-1_BIB1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF00289146","article-title":"Expected behaviour of B+-trees under random insertions","volume":"26","author":"Baeza-Yates","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(95)00189-1_BIB2","series-title":"Foundations of Applied Combinatorics","author":"Bender","year":"1991"},{"key":"10.1016\/0020-0190(95)00189-1_BIB3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0306-4379(89)90001-X","article-title":"An analysis of B-trees and their variants","volume":"14","author":"Chu","year":"1989","journal-title":"Inform. Systems"},{"key":"10.1016\/0020-0190(95)00189-1_BIB4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","article-title":"Singularity analysis of generating functions","volume":"3","author":"Flajolet","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(95)00189-1_BIB5","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\/0020-0190(95)00189-1_BIB6","volume":"Vol. I","author":"Henrici","year":"1988"},{"key":"10.1016\/0020-0190(95)00189-1_BIB7","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(95)00189-1_BIB8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(84)90085-1","article-title":"Approximate utilization of B-trees: A simple derivation and generalisations","volume":"19","author":"Leung","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00189-1_BIB9","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"},{"key":"10.1016\/0020-0190(95)00189-1_BIB10","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/0020-0190(95)00189-1_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0166-218X(91)90088-E","article-title":"The Riordan group","volume":"34","author":"Shapiro","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(95)00189-1_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)00570-H","article-title":"Riordan arrays and combinatorial sums","volume":"132","author":"Sprugnoli","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(95)00189-1_BIB13","series-title":"Generatingfunctionology","author":"Wilf","year":"1990"},{"key":"10.1016\/0020-0190(95)00189-1_BIB14","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 Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001891?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001891?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:23:01Z","timestamp":1556058181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095001891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0020019095001891"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00189-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}