{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:50Z","timestamp":1725455450115},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540522913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022161","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:40:43Z","timestamp":1131860443000},"page":"16-28","source":"Crossref","is-referenced-by-count":1,"title":["An adaptive overflow technique for B-trees"],"prefix":"10.1007","author":[{"given":"Ricardo A.","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Handbook of Mathematical Functions","author":"M. Abramowitz","year":"1972","unstructured":"M. Abramowitz and I. Stegun. Handbook of Mathematical Functions. Dover, New York, 1972."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173\u2013189, 1972.","journal-title":"Acta Informatica"},{"key":"2_CR3","unstructured":"R.A. Baeza-Yates. Analyzing deletions in B-trees. Dept. of Computer Science, Univ. of Waterloo (unpublished manuscript), 1987."},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF00289146","volume":"26","author":"R.A. Baeza-Yates","year":"1989","unstructured":"R.A. Baeza-Yates. Expected behaviour of B +-trees under random insertions. Acta Informatica, 26(5):439\u2013472, 1989. Also as Research Report CS-86-67, University of Waterloo, 1986.","journal-title":"Acta Informatica"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00289146","volume":"26","author":"R.A. Baeza-Yates","year":"1989","unstructured":"R.A. Baeza-Yates. Modeling splits in file structures. Acta Informatica, 26(4):349\u2013362, 1989. Also as Institute for Computer Research Report UW\/ICR 87-08, 1987.","journal-title":"Acta Informatica"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"R.A. Baeza-Yates and P-\u00c5. Larson. Performance of B +-trees with partial expansions. IEEE Trans. on Knowledge and Data Engineering, 1:to appear, 1989. Also as Research Report CS-87-04, Dept. of Computer Science, University of Waterloo, 1987.","DOI":"10.1109\/69.87964"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","volume":"55","author":"B. Eisenbarth","year":"1982","unstructured":"B. Eisenbarth, N. Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, and Derick Wood. The theory of fringe analysis and its application to 2\u20133 trees and B-trees. Information and Control, 55(1):125\u2013174, Oct 1982.","journal-title":"Information and Control"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"T. Johnson and D. Shasha. Utilization of B-trees with inserts, deletes and modifies. In PODS'89, pages 235\u2013246, 1989.","DOI":"10.1145\/73721.73745"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/12047.12049","volume":"12","author":"D. Lomet","year":"1987","unstructured":"D. Lomet. Partial expansions for file organizations with an index. ACM TODS, 12:65\u201384, 1987. Also as tech report, Wang Institute, TR-86-06, 1986.","journal-title":"ACM TODS"},{"key":"2_CR10","unstructured":"T. Mizoguchi. On required space for random split trees. In Allerton Conference, pages 265\u2013273, Monticello, IL, 1979."},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A.C-C. Yao","year":"1978","unstructured":"A.C-C. Yao. On random 2\u20133 trees. Acta Informatica, 9(2):159\u2013170, 1978.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT '90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022161.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:47:43Z","timestamp":1607550463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540522913"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0022161","relation":{},"subject":[]}}