计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (34): 168-170.

• 网络、通信与安全 • 上一篇    下一篇

一种适用于大规模特征集的快速匹配算法

李 雪1,薛一波2,王春露1   

  1. 1.北京邮电大学 计算机科学与技术学院,北京 100876
    2.清华大学 信息技术研究院,北京 100084
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-12-01 发布日期:2007-12-01
  • 通讯作者: 李 雪

High-performance string matching algorithm for large scale string set

LI Xue1,XUE Yi-bo2,WANG Chun-lu1   

  1. 1.School of Computer Science & Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China
    2.Research Institute of Information Science and Technology,Tsinghua University,Beijing 100084,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-12-01 Published:2007-12-01
  • Contact: LI Xue

摘要: 提出了一种适用于大规模特征集的快速匹配算法——SRS算法,该算法性能优异,在特征集达到100 000条时,匹配速度比经典算法快10倍以上。该算法适用于内容过滤、防病毒、反垃圾邮件、短信过滤、网络入侵检测和防御等众多领域。

关键词: 字符串匹配, 大规模特征匹配, SRS算法

Abstract: A fast string matching algorithm for large scale string set called SRS is addressed in this paper,it can achieve good performance.The speed of string matching using SRS algorithm can be 10 times higher than that using classical algorithm when the string set is 100 thousand.SRS algorithm can be employed to many applications areas,such as content filtering,antivirus,anti-spam,short message filtering,IDS/IPS systems etc.

Key words: string matching, large scale set pattern matching, SRS algorithm