Research of fast and memory-efficient pattern matching algorithm
Sun Ke-ke · Computer Engineering and Applications Journal · 2008
Modified Aho-Corasick(MAC) algorithm,an effective string matching algorithm with advantages of both compact memo- ry and high performance,is proposed.By employing the characteristics of same states observed from the deterministic finite state automata,the proposed MAC significantly reduces the memory requirement without sacrificing high speed.The MAC algorithm also provides high flexibility that it can be tuned to fit specific performance requirement and resource constraints.The experimental re- suits show that the performance of ACMS is over 1.51～2.40 times in software implementation compared to existing state-of-the-art algorithms.