A Trie Compaction Algorithm for a Large Set of Keys.

@article{DBLP:journals/tkde/AoeMSP96,
  author    = {Jun-Ichi Aoe and
               Katsushi Morimoto and
               Masami Shishibori and
               Ki-Hong Park},
  title     = {A Trie Compaction Algorithm for a Large Set of Keys},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {8},
  number    = {3},
  year      = {1996},
  pages     = {476-491},
  ee        = {db/journals/tkde/AoeMSP96.html, db/journals/tkde/AoeMSP96.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1996 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

CDROM Edition

References

[1]

Alfred V. Aho, Margaret J. Corasick: Efficient String Matching: An Aid to Bibliographic Search. Commun. ACM 18(6): 333-340(1975)

[2]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7

[3]

Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman: Compilers: Princiles, Techniques, and Tools. Addison-Wesley 1986, ISBN 0-201-10088-6

[4]

M. Al-Suwaiyel, Ellis Horowitz: Algorithms for Trie Compaction. ACM Trans. Database Syst. 9(2): 243-263(1984)

[5]

Jun-Ichi Aoe, Yoneo Yamamoto, Ryosaku Shimada: A Method for Improving String Pattern Matching Machine. IEEE Trans. Software Eng. 10(1): 116-120(1984)

[6]

...

[7]

...

[8]

Jun-Ichi Aoe: An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Trans. Software Eng. 15(9): 1066-1077(1989)

[9]

...

[10]

...

[11]

Jun-Ichi Aoe, Katsushi Morimoto, Takashi Sato: An Efficient Implementation of Trie Structures. Softw., Pract. Exper. 22(9): 695-721(1992)

[12]

Andrew W. Appel, Guy J. Jacobson: The World's Fastest Scrabble Program. Commun. ACM 31(5): 572-578(1988)

[13]

Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3): 578-595(1987)

[14]

Claudio L. Lucchesi, Tomasz Kowaltowski: Applications of Finite Automata Representing Large Vocabularies. Softw., Pract. Exper. 23(1): 15-30(1993)

[15]

John A. Dundas III: Implementing Dynamic Minimal-prefix Tries. Softw., Pract. Exper. 21(10): 1027-1040(1991)

[16]

Richard J. Enbody, H. C. Du: Dynamic Hashing Schemes. ACM Comput. Surv. 20(2): 85-113(1988)

[17]

Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344(1979)

[18]

...

[19]

Michael L. Fredman, János Komlós, Endre Szemerédi: Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31(3): 538-544(1984)

[20]

Wiebren de Jonge, Andrew S. Tanenbaum, Reind P. van de Riet: Two Access Methods Using Compact Binary Trees. IEEE Trans. Software Eng. 13(7): 799-810(1987)

[21]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X

[22]

Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong: Trie Hashing With Controlled Load. IEEE Trans. Software Eng. 17(7): 678-691(1991)

[23]

Kurt Maly: Compressed Tries. Commun. ACM 19(7): 409-415(1976)

[24]

...

[25]

...

[26]

...

[27]

...

[28]

...

[29]

...

[30]

...

[31]

Robert Endre Tarjan, Andrew Chi-Chih Yao: Storing a Sparse Table. Commun. ACM 22(11): 606-611(1979)