A compact static double-array keeping character codes

Information Processing and Management

Volumn 43, Issue 1, 2007, Pages 237-247

  Yata, Susumu ^a   Oono, Masaki ^a   Morita, Kazuhiro ^a   Fuketa, Masao ^a   Sumitomo, Toru ^a   Aoe, Jun ichi ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

Compaction; Dictionary; Double array

Indexed keywords

COMPUTER PERIPHERAL EQUIPMENT; DATA PROCESSING; GLOSSARIES; INFORMATION ANALYSIS; INFORMATION RETRIEVAL; PARALLEL PROCESSING SYSTEMS;

CHARACTER CODES; DOUBLE-ARRAYS;

CODES (SYMBOLS);

EID: 33748758430     PISSN: 03064573     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipm.2006.04.004     Document Type: Article

References (19)

1. Aho A.V., and Corasick M.J. Efficient string matching: an aid to bibliographic search. Communications of the ACM 18 6 (1975) 333-340
2. Aho A.V., Hopcroft J.D., and Ullman J.D. Data structures and algorithms (1983), Addison-Wesley, Reading, MA
3. Aho A.V., Sethi R., and Ullman J.D. Compilers-Principles, techniques, and tools (1986), Addison-Wesley, Reading, MA Chapters 3 and 4
4. Aoe J. An efficient digital search algorithm by using a double-array structure. IEEE Transactions on Software Engineering 15 9 (1989) 1066-1077
5. Aoe J., Morimoto K., and Sato T. An efficient implementation of trie structures. Software-Practice and Experience 22 9 (1992) 695-721
6. Aoe J., Morimoto K., Shishibori M., and Park K.-H. A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering 8 3 (1996) 476-491
7. Dundas J.A. Implementing dynamic minimal prefix tries. Software-Practice and Experience 21 10 (1991) 1024-1040
8. Fredkin E. Trie memory. Communications of the ACM 3 9 (1960) 490-500
9. Jung M., Shishibori M., Tanaka Y., and Aoe J. A dynamic construction algorithm for the compact patricia trie using the hierarchical structure. Information Processing and Management 38 (2002) 221-236
10. Koyama M., Morita K., Fuketa M., and Aoe J. A fast retrieving algorithm of hierarchical relationships using trie structures. Information Processing and Management 34 6 (1998) 761-773
11. Lesk M.E. Lex-a lexical analyzer generator. CSTR 39 (1975), Bell Lab., NJ pp. 1-13
12. Marshall D.B., and Alan L.T. Using tries to eliminate pattern collisions in perfect hashing. IEEE Transactions on Knowledge and Data Engineering 6 2 (1994) 239-247
13. Michael J.N. A prefix trie index for inverted files. Information Processing and Management 33 6 (1997) 739-744
14. Morimoto K., Iriguchi H., and Aoe J. A method of compressing trie structures. Software-Practice and Experience 24 3 (1994) 265-288
15. Morita K., Fuketa M., Yamakawa Y., and Aoe J. Fast insertion methods of a double-array structure. Software-Practice and Experience 31 (2001) 43-65
16. Okada K., Ando K., Lee S.S., Hayashi Y., and Aoe J. An efficient substring search method by using delayed keyword extraction. Information Processing and Management 37 (2001) 741-761
17. Oono M., Atlam E., Fuketa M., Morita K., and Aoe J. A fast and compact elimination method of empty elements from a double-array structure. Software-Practice and Experience 33 August (2003) 1229-1249
18. Peterson J.L. Computer programs for spelling correction. Lecture notes in computer science (1980), Springer-Verlag
19. WordNet 2.1. WordNet 2.1 reference manual (2005), Cognitive Science Laboratory. http://wordnet.princeton.edu Available from