Accelerating Multiple String Matching by Using Cache-efficient Strategy

摘要：

String matching plays a fundamental role in many network security applications such as NIDS, virus detection and information filtering. In this paper, we proposed cacheefficient methods to accelerate classical multiple string matching algorithms. We observed that most classical algorithms perform poorly as pattern set grows due to their high memory requirement and the poor cache behavior. Based on this observation, we proposed efficient methods employing cache-efficient strategies, i.e., to accelerate string matching by minimizing memory usage and maximizing cache locality. Experimental results on random datasets demonstrated that our new methods are substantially faster than classical methods.

作者: Jianlong Tan Yanbing Liu Ping Liu

作者单位: Institute of Computing Technology,Chinese Academy of Sciences,Beijing,100190

会议类型: 国际会议

会议名称: The Ninth International Conference on Web-Age Information Management(第九届web时代信息管理国际会议)(WAIM 2008)

会议地点: 张家界

会议语种:英文

在线出版日期: 2008-07-20（万方平台首次上网日期，不代表论文的发表时间）