{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:53:48Z","timestamp":1648716828405},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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 & Management"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0306-4573(99)00035-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:36:33Z","timestamp":1027647393000},"page":"379-399","source":"Crossref","is-referenced-by-count":0,"title":["Two improved access methods on compact binary (CB) trees"],"prefix":"10.1016","volume":"36","author":[{"given":"Masami","family":"Shishibori","sequence":"first","affiliation":[]},{"given":"Masafumi","family":"Koyama","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Okada","sequence":"additional","affiliation":[]},{"given":"Jun-ichi","family":"Aoe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0306-4573(99)00035-7_BIB1","series-title":"Data structures and algorithms","author":"Aho","year":"1983"},{"issue":"3","key":"10.1016\/S0306-4573(99)00035-7_BIB2","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/69.506713","article-title":"A trie compaction algorithm for a large set of keys","volume":"8","author":"Aoe","year":"1996","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"10.1016\/S0306-4573(99)00035-7_BIB3","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/32.31365","article-title":"An efficient digital search algorithm by using a double-array structure","volume":"15","author":"Aoe","year":"1989","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0306-4573(99)00035-7_BIB4","series-title":"Computer algorithms\u2013key search strategies","author":"Aoe","year":"1991"},{"issue":"3","key":"10.1016\/S0306-4573(99)00035-7_BIB5","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","article-title":"Complete inverted files for efficient text retrieval and analysis","volume":"34","author":"Blumer","year":"1987","journal-title":"Journal of the ACM"},{"issue":"9","key":"10.1016\/S0306-4573(99)00035-7_BIB6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie memory","volume":"3","author":"Fredkin","year":"1960","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0306-4573(99)00035-7_BIB7","series-title":"Handbook of algorithms and data structures","first-page":"25","article-title":"Searching algorithms","author":"Gonnet","year":"1984"},{"key":"10.1016\/S0306-4573(99)00035-7_BIB8","series-title":"Information retrieval: data structures and algorithms","first-page":"66","article-title":"New indices for text: Pat trees and Pat arrays","author":"Gonnet","year":"1992"},{"issue":"7","key":"10.1016\/S0306-4573(99)00035-7_BIB9","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/TSE.1987.233491","article-title":"Two access methods using compact binary trees","volume":"13","author":"Jonge","year":"1987","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"7","key":"10.1016\/S0306-4573(99)00035-7_BIB10","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/32.83904","article-title":"Trie hashing with controlled load","volume":"17","author":"Litwin","year":"1991","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"10.1016\/S0306-4573(99)00035-7_BIB11","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"PATRICIA: practical algorithm to retrieve information coded in alpha-numeric","volume":"14","author":"Morrison","year":"1968","journal-title":"Journal of ACM"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457399000357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457399000357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T15:24:26Z","timestamp":1555341866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457399000357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0306457399000357"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4573(99)00035-7","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}