A Table Compression Method for Extended Aho-Corasick Automaton

Authors:
Yanbing Liu;Yifu Yang;Ping Liu;Jianlong Tan
Affiliations:
Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190 and Graduate School of Chinese Academy of Sciences, Beijing 100190;Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190 and Graduate School of Chinese Academy of Sciences, Beijing 100190;Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190;Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190
Venue:
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Year:
2009

Citing 13
Cited 0

Optimization of parser tables for portable compilers

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
An Efficient Implementation of Static String Pattern Matching Machines

IEEE Transactions on Software Engineering
An efficient implementation of trie structures

Software—Practice & Experience
Improved behaviour of tries by adaptive branching

Information Processing Letters
Storing a sparse table

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Tetris-hashing or optimal table compression

Discrete Applied Mathematics
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Compressed Storage of Sparse Finite-State Transducers

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
An n log n algorithm for minimizing states in a finite automaton

An n log n algorithm for minimizing states in a finite automaton
Efficient implementation of Aho–Corasick pattern matching automata using Unicode

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.