A memory-efficient multi-pattern matching algorithm based on the bitmap

Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009

Volumn , Issue , 2009, Pages 1-5

  Zhang, Weizhe ^a   Zhang, Yuanjing ^a   Zhang, Hongli ^a   Gu, Xuemai ^a   Cheng, Albert M K ^b  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b University of Houston   (United States)

Author keywords

AC bitmap algorithm; Aho Corasick algorithm; Multipattern matching; String matching

Indexed keywords

EFFICIENCY;

AHO-CORASICK ALGORITHMS; MEMORY CONSUMPTION; MEMORY EFFICIENT; MULTI-PATTERN MATCHING; MULTIPLE-PATTERN MATCHING; OPTIMIZATION ALGORITHMS; STRING MATCHING; TIME EFFICIENCIES;

PATTERN MATCHING;

EID: 77958533075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICSE.2009.37     Document Type: Conference Paper

References (15)

1. A. V. Aho and M.J. Corasick, "Efficient String Matching: An Aid to Bibliographic search," Communications of the ACM, Vol. 18, Issue 6, 1975, pp. 333-340.
2. S. Wu and U. Manber, "A Fast Algorithms for Multi-pattern Searching," Report TR-94-17, Department of Computer Science, University of Arizona, 1994.
3. M. Crochemore, A. Czumaj, L. Gasieniec, T. Lecroq, W. Plandowski, and W. Rytter, "Faster practical multi-pattern matching," Information Process. Letters, Vol. 71, Issue 324, 1999, pp. 107-113
4. C. Allauzen and M. Raffinot, "Simple Optimal String Matching," Journal of Algorithms, Vol. 36, 2000, pp. 102-116.
5. G. Navarro and M. Raffinot, "Flexible Pattern Matching in Strings," Cambridge University Press, 2002.
6. B. W. Watson, "The performance of single-keyword and multiple-keyword pattern matching algorithms," Tech. Rep. 94/19, Eindhoven University of Technology, 1994.
7. R. A. Baeza-Yates and G. H. Gonnet, "A New Approach to Text Searching," In Proceeding of the 12th Annual ACM-SIGIR Conference on Information Retrieval, 1989, pp. 168-175.
8. nd International Symposium on Computer Architecture (ISCA 2005), 2005, pp. 112-122
9. rd IEEE Infocom Conference, 2004, pp.333-340.
10. A. C. Yao, "The Complexity of Pattern Matching for a Random String," SIAM Journal on Computing, Vol. 8, Issue 3, 1979, pp. 368-387.
11. C. Charras and T. Lecroq, "Handbook of Exact String-Matching Algorithms," King's College London Publications, 2004.
12. R. S. Boyer and J. S. Moore, "A Fast String Search Algorithm," Communications of the ACM, Vol. 20, Issue 10, 1977, pp. 762-772.
13. B. Commentz-Walter, "A String Matching Algorithm Fast on the Average." In Proceedings of the 6th International Colloquium on Automata, Languages and Programming, 1979, pp. 118-132.
14. M. Crochemore and C. Hancart, "Automata for Matching Patterns," In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, 1997, pp. 399-462.
15. P. Liu, Y. Liu and J. Tan, "A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching," in Proceeding of the 12th International Conference on String Processing and Information Retrieval (SPIRE 2005), 2005, pp 399-404.