会议专题

The Study and Improvement of AC_BM Multi-pattern Matching Algorithm

AC_BM multi-pattern matching algorithm realizes pattern-tree jumping-shift-matching, but the pattern-trees shift-distance is often shorter than the actual maximum shift distance. An improved algorithm - AC_QSS has been proposed in this paper. AC_QSS tries to shift the pattern-tree a distance to the length of the shortest pattern string as so as possible, so it can maximize the pattern-trees shift-distance and reduce the pattern-trees shift-number. Experimental results show that the time performance of AC_QSS algorithm is better than AC_BM algorithm.

multi-pattern matching content mering AC_BM AC_QSS

Zhengfeng Hou Yindong Shu Jianghong Han Liang Ding

School of Computer & Information Hefei University of Technology Hefei, Anhui, China

国际会议

2010 International Conference on Information Security and Artificial Intelligence(2010年信息安全与人工智能国际会议 ISAI 2010)

成都

英文

38-42

2010-12-17(万方平台首次上网日期,不代表论文的发表时间)