{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T10:15:57Z","timestamp":1672481757547},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,9,1]],"date-time":"1981-09-01T00:00:00Z","timestamp":368150400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1981,9]]},"DOI":"10.1007\/bf01941465","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T10:53:23Z","timestamp":1122807203000},"page":"305-316","source":"Crossref","is-referenced-by-count":3,"title":["On the allocation of binary trees to secondary storage"],"prefix":"10.1007","volume":"21","author":[{"given":"Renzo","family":"Sprugnoli","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01941465_CR1","volume-title":"Handbook of Mathematical Functions","author":"M. Abramowitz","year":"1964","unstructured":"Abramowitz, M., Stegun, I. A.,Handbook of Mathematical Functions. Nat. Bureau of Standards, Washington D.C., 1964."},{"issue":"2","key":"BF01941465_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.,The ubiquitous B-tree. ACM Computing Surveys, 11, 2 (1979) pp. 121\u2013136.","journal-title":"ACM Computing Surveys"},{"key":"BF01941465_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippenger, R., Strong, H. R.,Extendible hashing\u2014a fast access method for dynamic files. ACM Trans. on D.B. Systems, 4, (1979), pp. 315\u2013344.","journal-title":"ACM Trans. on D.B. Systems"},{"key":"BF01941465_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"A Comparative Study of Very Large Data Bases","author":"E. Hill Jr.","year":"1978","unstructured":"Hill, E. Jr.,A Comparative Study of Very Large Data Bases. Lecture Notes in Computer Science, n. 59, Springer Verlag, Berlin 1978."},{"key":"BF01941465_CR5","volume-title":"The Art of Computer Programming, vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.,The Art of Computer Programming, vol. 3. Addison Wesley, Reading Mass., 1973."},{"key":"BF01941465_CR6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P. Larson","year":"1978","unstructured":"Larson, P.,Dynamic hashing. BIT 18, (1978), pp. 184\u2013201.","journal-title":"BIT"},{"key":"BF01941465_CR7","unstructured":"Litwin, W.,Linear hashing: a new tool for files and tables addressing. SIRIUS report MAP-I-009, Le Chesnay, Nov. 1979."},{"key":"BF01941465_CR8","first-page":"345","volume":"4","author":"R. Muntz","year":"1970","unstructured":"Muntz, R., Uzgalis, R.,Dynamic storage allocation for binary search trees in a two-level memory. Proc. Princeton Conf. on Inf. Sciences and Systems, 4, (1970), pp. 345\u2013349.","journal-title":"Proc. Princeton Conf. on Inf. Sciences and Systems"},{"issue":"3","key":"BF01941465_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/356631.356634","volume":"6","author":"J. Nievergelt","year":"1974","unstructured":"Nievergelt, J.,Binary search trees and file organization. ACM Computing Surveys, 6,3, (1974), pp. 195\u2013207.","journal-title":"ACM Computing Surveys"},{"key":"BF01941465_CR10","unstructured":"Sprugnoli, R.,On local properties of binary trees. IEI report B77-6, Pisa, March 1977."},{"key":"BF01941465_CR11","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BF01932276","volume":"16","author":"L. B. Wilson","year":"1976","unstructured":"Wilson, L. B.,Sequence search trees: their analysis using recurrence relations, BIT, 16 (1976), pp. 332\u2013337. See also the technical report n. 76 (of the same title) of the University of Newcastle upon Tyne (Oct. 1975).","journal-title":"BIT"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941465.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01941465\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:34:01Z","timestamp":1557765241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01941465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,9]]}},"alternative-id":["BF01941465"],"URL":"https:\/\/doi.org\/10.1007\/bf01941465","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,9]]}}}