{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:17:43Z","timestamp":1742617063382,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518594"},{"type":"electronic","value":"9783540468318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51859-2_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:18:26Z","timestamp":1330204706000},"page":"139-152","source":"Crossref","is-referenced-by-count":0,"title":["On some properties of (a,b)-trees"],"prefix":"10.1007","author":[{"given":"Renzo","family":"Sprugnoli","sequence":"first","affiliation":[]},{"given":"Elena","family":"Barcucci","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Chiuderi","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1080\/00150517.1973.12430815","volume":"11","author":"A. V. Aho","year":"1973","unstructured":"Aho A. V., Sloane N. J. A.: \u201cSome Doubly Exponential Sequences\u201d, Fibonacci Quarterly 11, 4 (1973), 429\u2013437","journal-title":"Fibonacci Quarterly"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer D.: \u201cThe Ubiquitous B-Tree\u201d, ACM Computing Surveys, 11, 2 (1979), 121\u2013137","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"P. Flajolet","year":"1982","unstructured":"Flajolet P., Odlyzko A.: \u201cExploring Binary Trees and Other Simple Trees\u201d, Journal of Computers and System Science, 25, 2 (1982), 171\u2013213","journal-title":"Journal of Computers and System Science"},{"key":"13_CR4","unstructured":"Greene D. H., Knuth D. E.: Mathematics for the Analysis of Algorithms, Birkh\u00e4user, Boston, Mass., 1982"},{"key":"13_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K.: Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, Berlin, 1984"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1137\/0208004","volume":"8","author":"R. E. Miller","year":"1979","unstructured":"Miller R. E., Pippenger N., Rosenberg A. L., Snyder L.: \u201cOptimal 2-3-trees\u201d, SIAM Journal on Computing, 8, 1 (1979), 42\u201359","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Optimal Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51859-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:57:39Z","timestamp":1742590659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51859-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518594","9783540468318"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-51859-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}