{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:51:05Z","timestamp":1761893465767},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":[[2002,3]]},"DOI":"10.1016\/s0306-4573(01)00031-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:54:01Z","timestamp":1027590841000},"page":"221-236","source":"Crossref","is-referenced-by-count":7,"title":["A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure"],"prefix":"10.1016","volume":"38","author":[{"given":"Minsoo","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masami","family":"Shishibori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuhiro","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-ichi","family":"Aoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0306-4573(01)00031-0_BIB1","series-title":"Data structures and algorithms","author":"Aho","year":"1983"},{"issue":"9","key":"10.1016\/S0306-4573(01)00031-0_BIB2","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(01)00031-0_BIB3","series-title":"Computer algorithms-key search strategies","author":"Aoe","year":"1991"},{"issue":"3","key":"10.1016\/S0306-4573(01)00031-0_BIB4","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":"3","key":"10.1016\/S0306-4573(01)00031-0_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"},{"key":"10.1016\/S0306-4573(01)00031-0_BIB6","unstructured":"Gonnet, G. H. (1984). Searching algorithms. In Handbook of algorithms and data structures (pp. 25\u2013147). Reading, MA: Addison-Wesley"},{"key":"10.1016\/S0306-4573(01)00031-0_BIB7","unstructured":"Gonnet, G. H., Baeza-Yates, R. A., & Snider, T. (1992). New indices for text: Pat trees and Pat arrays. In Information retrieval-data structures and algorithms (pp. 66\u201382). NJ: Prentice-Hall"},{"issue":"7","key":"10.1016\/S0306-4573(01)00031-0_BIB8","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(01)00031-0_BIB9","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(01)00031-0_BIB10","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"},{"issue":"37","key":"10.1016\/S0306-4573(01)00031-0_BIB11","first-page":"473","article-title":"Coding grams of variable length into fixed bytes for fast full text retrieval with compact indices","volume":"16","author":"Sato","year":"1999","journal-title":"IR-L Digest"},{"key":"10.1016\/S0306-4573(01)00031-0_BIB12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(91)90032-D","article-title":"An algorithm for string matching with a sequence of don't cares","volume":"37","author":"Manber","year":"1991","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0306-4573(01)00031-0_BIB13","unstructured":"Manber, U., Myers, G., (1990). Suffix arrays: a new method for on-line string searches. In 1st ACM-SIAM symposium on discrete algorithms (pp. 319\u2013327)"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457301000310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457301000310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:22:57Z","timestamp":1556896977000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457301000310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0306457301000310"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4573(01)00031-0","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}