Fast insertion methods of a double-array structure

Software - Practice and Experience

Volumn 31, Issue 1, 2001, Pages 43-65

  Morita, Kazuhiro ^a   Fuketa, Masao ^a   Yamakawa, Yoshihiro ^a   Aoe, Jun Ichi ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); INFORMATION RETRIEVAL; NATURAL LANGUAGE PROCESSING SYSTEMS; PROGRAM COMPILERS;

DOUBLE ARRAY STRUCTURE; INSERTION METHODS;

DATA STRUCTURES;

EID: 0035114148     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R     Document Type: Article

References (11)

1. Aho AV, Hopcroft JE, Ullman JD. Data Structures and Algorithms. Addison-Wesley: Reading, MA, 1983.
2. Fredkin E. Trie memory. Communications of the ACM 1960; 3(9):490-500.
3. Knuth DE. Fundamental algorithm. The Art of Computer Programming, vol. I. Addision-Wesley: Reading MA, 1973; 295-304.
4. Knuth DE. Sorting and searching, vol. III. Addision-Wesley: Reading MA, 1973; 481-505.
5. Peterson JL, Computer Programs for Spelling Correction (Lecture Notes in Computer Science). Springer-Verlag: New York, 1980.
6. Aho AV, Sethi R, Ullman JD. Compilers Principles, Techniques, and Tools, Ch. 3. Addison-Wesley: Reading MA, 1986.
7. Lesk ME. Lex-a lexical analyzer generator. Report CSTR 39, Bell Labartories, NJ., 1975; 1-13.
8. Aho AV, Corasick MJ. Efficient string matching: An aid bibliographic search. Communications of the ACM 1975; 18(6):333-340.
9. Aoe J, Morimoto K, Shishibori M, Park K-H. A trie compaction algorithm for a large set of keys. IEEE Transactions on Knowledge and Data Engineering 1996; 8(3):476-491.
10. Aoe J. An efficient digital search algorithm by using a double-array structure. IEEE Transactions on Software Engineering 1989; 15(9):1066-1077.
11. Aoe J, Morimoto K, Sato T. An efficient implementation of trie structures. Software Practice and Experience 1992; 22(9):695-721.