Fast string matching with space-efficient word graphs

2008 International Conference on Innovations in Information Technology, IIT 2008

Volumn , Issue , 2008, Pages 79-83

  Yata, Susumu ^a   Morita, Kazuhiro ^a   Fuketa, Masao ^a   Aoe, Jun Ichi ^a  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT FILTERING SYSTEM; DIRECTED ACYCLIC WORD GRAPHS; FAST STRING MATCHING; LOOKUP TIME; MATRIX; PROCESSING APPLICATIONS; SPACE REQUIREMENTS; STRING MATCHING; TEXT MINING; WORD GRAPHS;

MINING; PATTERN MATCHING;

INNOVATION;

EID: 67649479590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INNOVATIONS.2008.4781726     Document Type: Conference Paper

References (14)

1. Aho, A. V., & Corasick, M. J. (1975). Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM , 18 (6), 333-340.
2. Jiang, B., & Liu, B. (2003, October 20-23). High-speed discrete content sensitive pattern match algorithm for deep packet filtering. The 2003 International Conference on Computer Networks and Mobile Computing 2003 (ICCNMC2003)
3. Song, T., Zhang, W., Wang, D., & Xue, Y. (2008, April 13-18). A Memory Efficient Multiple Pattern Matching Architecture for Network Security.The 27th Conference on Computer Communications (INFOCOM2008) , 166-170. Phoenix, AZ, USA.
4. Piyachon, P., & Luo, Y. (2007, June 4-8). Compact State Machines for High Performance Pattern Matching. The 44th Design Automation Conference (DAC'07) , 493-496. San Diego, USA.
5. Aho, A. V., Ullman, J. D., & Hopcroft, J. E. (1983). Data Structures and Algorithms. Addison Wesley.
6. Crochemore, M., & Vérin, R. (1997). On compact directed acyclic word graphs. Structures in Logic and Computer Science , 192-211. Springer-Verlag. (Pubitemid 127109932)
7. Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., & Arikawa, S. (2001, September). Construction of the CDAWG for a Trie. In Proc. The Prague Stringology Conference '01 , 37-48.
8. Fredkin, E. (1960). Trie Memory. Communications of the ACM , 3 (9), 490-499.
9. Aoe, J. (1996). A Trie Compaction Algorithm for a Large Set of Keys. IEEE Transactions on Knowledge and Data Engineering, 8 (3), 476-491. (Pubitemid 126777351)
10. Yata, S., Oono, M., Morita, K., Fuketa, M., Sumitomo, T., & Aoe, J. (2007). A compact static double-array keeping character codes. Information Processing and Management , 43 (1), 237-247. (Pubitemid 44404100)
11. Aoe, J. (1989). An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering , 15 (9), 1066-1077. (Pubitemid 20607065)
12. Bentley, J. L., & Sedgewick, R. (1997, January). Fast algorithms for sorting and searching strings. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , 360-369. New Orleans, Louisiana, USA.
13. Morita, K., Fuketa, M., Yamakawa, Y., & Aoe, J. (2001). Fast insertion methods of a double-array structure. Software Practice and Experience , 31, 43-65. (Pubitemid 32168469)
14. Oono, M., Atlam, E.-S., Fuketa, M., Morita, K., & Aoe, J. (2003). A fast and compact elimination method of empty elements from a double-array structure. Software Practice and Experience , 33, 1229-1249.