Name
Abstract | ||
|---|---|---|
By analyzing the existing pattern matching algorithms, we found AC_BM algorithm or AC_SUNDAY algorithm combine the advantages of AC algorithm and the single-pattern matching algorithms. When a mismatch occurs, the moving distance on matching trees become larger. Based on this idea, an improved jump step matching algorithm named AC_ID is proposed. When occurs the mismatch or the scanning is over, the moving distance on the matching tree is determined by the first four characters of the current matching window. It make the maximum jump distance on matching tree be equal to the shortest pattern string length plus four in the pattern string set. Furthermore, two fields (pattern string length, initial position) are added to each node to process the pattern string with anchoring. Finally, the experiment results show that either the number of moving or matching time, the proposed algorithm is better than AC_BM algorithm and AC_SUNDAY algorithm. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3290480.3290482 | ICCNS 2018: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON COMMUNICATION AND NETWORK SECURITY |
Keywords | DocType | Citations |
Multi-pattern matching,variable step,moving distance,anchoring,matching tree | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dapeng Man | 1 | 29 | 10.54 |
| Yang Wu | 2 | 69 | 22.62 |
| Guoqing Tian | 3 | 0 | 0.34 |