{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:44:27Z","timestamp":1775151867610,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,11]],"date-time":"2015-08-11T00:00:00Z","timestamp":1439251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10115-015-0873-0","type":"journal-article","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T09:27:40Z","timestamp":1439198860000},"page":"55-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A compression method of double-array structures using linear functions"],"prefix":"10.1007","volume":"48","author":[{"given":"Shunsuke","family":"Kanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Fuketa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Morita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-ichi","family":"Aoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"6","key":"873_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho AV, Corasick MJ (1975) Efficient string matching: an aid to bibliographic search. Commun ACM 18(6):333\u2013340","journal-title":"Commun ACM"},{"key":"873_CR2","unstructured":"Aho AV, Lam MS, Sethi R et al (2006) Compilers: principles, techniques, and tools, chaps 3 and 4, 2nd edn. Addison-Wesley, Boston"},{"issue":"9","key":"873_CR3","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/32.31365","volume":"15","author":"J Aoe","year":"1989","unstructured":"Aoe J (1989) An efficient digital search algorithm by using a double-array structure. IEEE Trans Softw Eng 15(9):1066\u20131077","journal-title":"IEEE Trans Softw Eng"},{"issue":"9","key":"873_CR4","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1002\/spe.4380220902","volume":"22","author":"J Aoe","year":"1992","unstructured":"Aoe J, Morimoto K, Sato T (1992) An efficient implementation of trie structures. Softw Pract Exp 22(9):695\u2013721","journal-title":"Softw Pract Exp"},{"issue":"3","key":"873_CR5","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/69.506713","volume":"8","author":"J Aoe","year":"1996","unstructured":"Aoe J, Morimoto K, Shishibori M et al (1996) A trie compaction algorithm for a large set of keys. IEEE Trans Knowl Data Eng 8(3):476\u2013491","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"873_CR6","doi-asserted-by":"crossref","unstructured":"Arroyuelo D, Cnovas R, Navarro G et al (2010) Succinct trees in practice. In: ALENEX, pp 84\u201397","DOI":"10.1137\/1.9781611972900.9"},{"issue":"6","key":"873_CR7","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1145\/235809.235810","volume":"43","author":"RA Baeza-Yates","year":"1996","unstructured":"Baeza-Yates RA, Gonnet GH (1996) Fast text searching for regular expressions or automaton searching on tries. J ACM 43(6):915\u2013936","journal-title":"J ACM"},{"key":"873_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D Benoit","year":"2005","unstructured":"Benoit D, Demaine ED, Munro JI et al (2005) Representing trees of higher degree. Algorithmica 43:275\u2013292","journal-title":"Algorithmica"},{"issue":"2","key":"873_CR9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/69.277768","volume":"6","author":"M Brain","year":"1994","unstructured":"Brain M, Tharp A (1994) Using tries to eliminate pattern collisions in perfect hashing. IEEE Trans Knowl Data Eng 6(2):239\u2013247","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"873_CR10","first-page":"134","volume":"2006","author":"O Delpratt","year":"2006","unstructured":"Delpratt O, Rahman N, Raman R (2006) Engineering the louds succinct tree representation. Proc WEA 2006:134\u2013145","journal-title":"Proc WEA"},{"issue":"9","key":"873_CR11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin E (1960) Trie memory. Commun ACM 3(9):490\u2013499","journal-title":"Commun ACM"},{"issue":"3","key":"873_CR12","first-page":"18","volume":"2","author":"J Fu","year":"2007","unstructured":"Fu J, Hagsand O, Karlsson G (2007) Improving and analyzing LC-trie performance for IP-address lookup. J Netw 2(3):18\u201327","journal-title":"J Netw"},{"issue":"5","key":"873_CR13","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1016\/j.ipm.2014.04.004","volume":"50","author":"M Fuketa","year":"2014","unstructured":"Fuketa M, Kitagawa H, Ogawa T et al (2014) Compression of double array structures for fixed length keywords. Inf Process Manag 50(5):796\u2013806","journal-title":"Inf Process Manag"},{"key":"873_CR14","doi-asserted-by":"crossref","unstructured":"Huang K, Xie G, Li Y, et al (2011) Offset addressing approach to memory-efficient IP address lookup. In: Proceedings of the IEEE INFOCOM, pp 306\u2013310","DOI":"10.1109\/INFCOM.2011.5935151"},{"key":"873_CR15","doi-asserted-by":"crossref","unstructured":"Jacobson G (1989) Space-efficient static trees and graphs. In: 30th annual symposium on foundations of computer science, pp 549\u2013554","DOI":"10.1109\/SFCS.1989.63533"},{"key":"873_CR16","unstructured":"Jansson J, Sadakane K, Sung W (2007) Ultra-succinct representation of ordered trees. In: ACM\u2013SIAM symposium on discrete algorithms, pp 575\u2013584"},{"key":"873_CR17","unstructured":"Liu H, Nuo M, Ma L et al (2011) Compression methods by code mapping and code dividing for Chinese dictionary stored in a double-array trie. In: IJCNLP, pp 1189\u20131197"},{"issue":"1","key":"873_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R","volume":"31","author":"K Morita","year":"2001","unstructured":"Morita K, Fuketa M, Yamakawa Y et al (2001) Fast insertion methods of a double-array structure. Softw Pract Exp 31(1):43\u201365","journal-title":"Softw Pract Exp"},{"issue":"12","key":"873_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0255(03)00189-0","volume":"159","author":"K Morita","year":"2004","unstructured":"Morita K, Atlam E, Fuketa M et al (2004) Fast and compact updating algorithms of a double-array structure. Inf Sci 159(12):53\u201367","journal-title":"Inf Sci"},{"key":"873_CR20","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J Munro","year":"2001","unstructured":"Munro J, Raman V (2001) Succinct representation of balanced parentheses and static trees. SIAM J Comput 31:762\u2013776","journal-title":"SIAM J Comput"},{"issue":"1","key":"873_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S1570-8667(03)00066-2","volume":"2","author":"G Navarro","year":"2004","unstructured":"Navarro G (2004) Indexing text using the zivlempel trie. J Discret Algorithms 2(1):87\u2013114","journal-title":"J Discret Algorithms"},{"key":"873_CR22","volume-title":"Computer programs for spelling correction: an experiment in program design","author":"J Peterson","year":"1980","unstructured":"Peterson J (1980) Computer programs for spelling correction: an experiment in program design. Springer, Berlin"},{"key":"873_CR23","doi-asserted-by":"crossref","unstructured":"Sadakane K, Navarro G (2010) Fully-functional succinct trees. In: Proceedings of the 21st annual ACM\u2013SIAM symposium on discrete algorithms, pp 134\u2013149","DOI":"10.1137\/1.9781611973075.13"},{"key":"873_CR24","doi-asserted-by":"crossref","unstructured":"Srinivasan V, Varghese G, Suri S et al (1998) Fast and scalable layer four switching. In: Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication (ACM SIGCOMM \u201998), pp 191\u2013202","DOI":"10.1145\/285237.285282"},{"issue":"4","key":"873_CR25","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1080\/17517575.2012.665483","volume":"6","author":"L Yang","year":"2012","unstructured":"Yang L, Xu L, Shi Z (2012) An enhanced dynamic hash trie algorithm for lexicon search. Enterp Inf Syst 6(4):419\u2013432","journal-title":"Enterp Inf Syst"},{"issue":"5","key":"873_CR26","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/spe.778","volume":"37","author":"S Yata","year":"2007","unstructured":"Yata S, Oono M, Morita K et al (2007a) An efficient deletion method for a minimal prefix double array. Softw Pract Exp 37(5):523\u2013534","journal-title":"Softw Pract Exp"},{"issue":"1","key":"873_CR27","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.ipm.2006.04.004","volume":"43","author":"S Yata","year":"2007","unstructured":"Yata S, Oono M, Morita K et al (2007b) A compact static double-array keeping character codes. Inf Process Manag 43(1):237\u2013247","journal-title":"Inf Process Manag"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0873-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0873-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0873-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:18Z","timestamp":1559110278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0873-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,11]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["873"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0873-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,11]]}}}