The Aho-Corasick algorithm is a classic method for matching a set of strings. However, the huge memory usage of Aho-Corasick automaton prevents it from being applied to large-scale pattern sets. Here we present a simple but efficient table compression method to reduce the automaton's space. The basic idea of our method is based on equivalent rows elimination, which groups state rows into equivalent classes and eliminates the duplicates. Experiments demonstrate that the proposed method significantly reduces the memory usage and still runs at linear searching time comparable to that of extended Aho-Corasick algorithm. Our method provides good trade-off between memory usage and searching time. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Liu, Y., Yang, Y., Liu, P., & Tan, J. (2009). A table compression method for extended aho-corasick automaton. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5642 LNCS, pp. 84–93). https://doi.org/10.1007/978-3-642-02979-0_12
Mendeley helps you to discover research relevant for your work.