Name
Abstract | ||
|---|---|---|
String matching plays a fundamental role in many network security applications such as NIDS, virus detection and information filtering. In this paper, we proposed cache-efficient 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/WAIM.2008.80 | WAIM |
Keywords | Field | DocType |
classical method,classical algorithm,string matching,memory usage,pattern set,poor cache behavior,cache storage,cache locality maximization,bit vector,cache-efficient,classical multiple string,network security application,cache locality,accelerating multiple string matching,multiple string matching algorithm acceleration,high memory requirement,memory usage minimization,table compression,cache-efficient method,multiple string matching,cache-efficient strategy,minimisation,information security,intrusion detection,information management,automata,matched filters,data structures,algorithm design and analysis,network security,degradation,acceleration | String searching algorithm,Algorithm design,Commentz-Walter algorithm,High memory,Computer science,Cache,Network security,Parallel computing,Approximate string matching,Bit array | Conference |
ISBN | Citations | PageRank |
978-0-7695-3185-4 | 0 | 0.34 |
References | Authors | |
18 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianlong Tan | 1 | 132 | 22.14 |
| Yanbing Liu | 2 | 56 | 10.17 |
| Ping Liu | 3 | 14 | 7.39 |