Fast pattern detection in stream data

Proceedings - International Conference on Advanced Information Networking and Applications, AINA

Volumn 1, Issue , 2005, Pages 125-130

  Sheu, Simon ^a   Cheng, Chang Yeng ^a   Chang, Alan ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA ACQUISITION; DECISION MAKING; INTERNET; OPTIMIZATION; TREES (MATHEMATICS);

CLASSICAL STRING MATCHING SCHEMES; DIGITAL POLLUTION; FAST PATTERN DETECTION;

PATTERN RECOGNITION;

EID: 33744494001     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2005.184     Document Type: Conference Paper

References (25)

1. A. V. Aho and M. J. Corasick, "Efficient String Matching: An Aid to Bibliographic Search," Communications of the ACM, 18(6):333-340, 1975.
2. S. Antonatos, K. G. Anagnostakis, and E. P. Markatos, "Generating Realistic Workloads for Network Intrusion Detection Systems," in Proc. of ACM Workshop on Software and Performance, 2004.
3. R. S. Boyer and J. S. Moore, "A fast string searching algorithm," Comm. of the ACM, 20(10):762-772, 1977.
4. C. Charras, T. Lecroq, and J. D. Pehoushek, "A very fast string matching algorithm for small alphabets and long patterns," in Proc. of the 9th Annual Symposium on Combinatorial Pattern Matching, pp. 55-64, 1998.
5. C. J. Coit, S. Staniford, and J. McAlerney, "Towards Faster Pattern Matching for Intrusion Detection, or Exceeding the Speed of Snort," in Proc. of DISCEX II, June, 2002.
6. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan, "Comparing Data Streams Using Hamming Norms (How to Zero In)," in Proc. of VLDB, Hong Kong, China, August 20-23, 2002.
7. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter, "Speeding up Two String Matching Algorithms," Algorithmica, 12(4/5):247-267, 1994.
8. M. Fisk and G. Varghese, "Fast Content-Based Packet Handling for Intrusion Detection," University of California San Diego, TR:CS2001-0670, May, 2001.
9. G. R. Ganger, G. Economou, and S. M. Bielski, "Finding and containing enemies within the walls with self-securing network interfaces," Carnegie Mellon University, TR:CMU-CS-03-109, January, 2003.
10. J. Han and M. Kamber, Data Mining: Concepts and Techniques: Morgan Kaufmann Publishers, 2001.
11. N. Jiang, K. A. Hua, and S. Sheu, "Considering both Intra-Pattern and Inter-Pattern Anomalies in Intrusion Detection," in Proc. of IEEE ICDM, Dec. 9-12, 2002.
12. T. Kahveci and A. K. Singh, "An Efficient Index Structure for String Databases," in Proc. of VLDB, Roma, Italy, pp. 351-360, 2001.
13. W. J. Kent, "BLAT-The BLAST-Like Alignment Tool," Genome Research, 12(4):656-664, April, 2002.
14. S. Kim and Y. Kim, "A Fast Multiple String-Pattern Matching Algorithm," in Proc. of the 17th AoM/IAoM Conference on Computer Science, 1999.
15. D. E. Knuth, J. H. Morris, and V. R. Pratt, "Fast pattern matching in strings," SIAM JoC, 6(1):323-350, 1977.
16. T. Lecroq, "A Variant on the Boyer-Moore Algorithm," Theoretical CS, 92(1):119-144, 1992.
17. D. Moore, C. Shannon, G. M. Voelker, and S. Savage, "Internet Quarantine: Requirements for Containing Self-Propagating Code," in Proc. of IEEE INFOCOM, San Francisco, USA, March, 2003.
18. S. H. Mueller, "Fight Spam on the Internet!" http://spam.abuse.net/, 2003.
19. O. Ozturk and H. Ferhatosmanoglu, "Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases," in Proc. of IEEE Sym. on BioInformatics and BioEngineering, March, 2003.
20. Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa, "Speeding Up Pattern Matching by Text Compression," in Proc. of the 4th Italian Conference on Algorithms and Complexity, Italy, pp. 306-315, 2000.
21. D. M. Sunday, "A Very Fast Substring Search Algorithm," Comm. of the ACM, 33(8):132-142, 1990.
22. N. Tuck, T. Sherwood, B. Calder, and G. Varghese, "Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection," in Proc. of IEEE INFOCOM, 2004.
23. S. Wu and U. Manber, "A Fast Algorithm for Multi-Pattern Searching," Computer Science, University of Arizona, TR:94-17, May, 1994.
24. R. F. Zhu and T. Takaoka, "On Improving the Average Cast of the Boyer-Moore String Matching Algorithm," J. of Information Processing, 10(3): 173-177, 1987.
25. Y. Zhu and D. Shasha, "StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time," in Proc. of VLDB, Hong Kong, China, August 20-23, 2002.