{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:22Z","timestamp":1763468062012},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:37:38Z","timestamp":1330270658000},"page":"49-60","source":"Crossref","is-referenced-by-count":1,"title":["A new algorithm for the construction of optimal B-trees"],"prefix":"10.1007","author":[{"given":"Peter","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"5_CR1","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, \u201cOrganization and Maintenance of Large Ordered Indexes,\u201d Acta Informatica, vol. 1, pp. 173\u2013189, 1972.","journal-title":"Acta Informatica"},{"issue":"no.3","key":"5_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0210031","volume":"10","author":"L. Gotlieb","year":"1981","unstructured":"L. Gotlieb, \u201cOptimal Multi-Way Search Trees,\u201d SIAM Journal of Computing, vol. 10, no. 3, pp. 422\u2013433, 1981.","journal-title":"SIAM Journal of Computing"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02017342","volume":"30","author":"S. Stephen Huang","year":"1990","unstructured":"Shou-Hsuan Stephen Huang and Venkatraman Viswanathan, \u201cOn the Construction of Weighted Time-Optimal B-Trees,\u201d Bit, vol. 30, pp. 207\u2013215, 1990.","journal-title":"Bit"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D. E. Knuth","year":"1971","unstructured":"D. E. Knuth, \u201cOptimum Binary Search Trees,\u201d Acta Informatica, vol. 1, pp. 14\u201325, 1971.","journal-title":"Acta Informatica"},{"key":"5_CR5","volume-title":"Operations Research","author":"K. Neumann","year":"1993","unstructured":"K. Neumann and M. Morlock, Operations Research, Hanser, Munich, 1993."},{"key":"5_CR6","unstructured":"J. Pearl, Heuristics \u2014 Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00288540","volume":"14","author":"V. K. Vaishnavi","year":"1980","unstructured":"V. K. Vaishnavi, H. P. Kriegel, and D. Wood, \u201cOptimum Multiway Search Trees,\u201d Acta Informatica, vol. 14, pp. 119\u2013133, 1980.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:13:02Z","timestamp":1619572382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}