{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:08:32Z","timestamp":1676970512703},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":[[2002,10]]},"DOI":"10.1016\/s0020-0190(02)00228-4","type":"journal-article","created":{"date-parts":[[2002,9,10]],"date-time":"2002-09-10T02:34:31Z","timestamp":1031625271000},"page":"69-73","source":"Crossref","is-referenced-by-count":6,"title":["On the existence and construction of non-extreme (a,b)-trees"],"prefix":"10.1016","volume":"84","author":[{"given":"Lars","family":"Jacobsen","sequence":"first","affiliation":[]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Morten N.","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00228-4_BIB001","series-title":"Proceedings of the 36th IEEE Symposium on Foundations of Computer Science","first-page":"655","article-title":"Sublogarithmic searching without multiplications","author":"Andersson","year":"1995"},{"key":"10.1016\/S0020-0190(02)00228-4_BIB002","series-title":"Proceedings of the 4th International Workshop on Algorithms and Data Structures","first-page":"334","article-title":"The buffer tree: A new technique for optimal I\/O-algorithms","volume":"955","author":"Arge","year":"1995"},{"key":"10.1016\/S0020-0190(02)00228-4_BIB003","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(02)00228-4_BIB004","series-title":"Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"366","article-title":"Sorting and searching on the word RAM","volume":"1373","author":"Hagerup","year":"1998"},{"key":"10.1016\/S0020-0190(02)00228-4_BIB005","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","article-title":"A new data structure for representing sorted lists","volume":"17","author":"Huddleston","year":"1982","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/S0020-0190(02)00228-4_BIB006","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1142\/S012905410100059X","article-title":"Variants of (a,b)-trees with relaxed balance","volume":"12","author":"Jacobsen","year":"2001","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00228-4_BIB007","series-title":"Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"93","article-title":"Relaxed multi-way trees with group updates","author":"Larsen","year":"2001"},{"key":"10.1016\/S0020-0190(02)00228-4_BIB008","series-title":"Sorting and searching","volume":"1","author":"Mehlhorn","year":"1984"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002284?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002284?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:28:44Z","timestamp":1556796524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0020019002002284"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00228-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}