A Fast Algorithm Used in Modern Network Search Engines for Matching String Patterns
Zhu Huai · Computer and Modernization · 2003
A fast algorithm that can perform multiple pattern match in a string is described.The proposed matching algorithm is based on the concept of deterministic finite state automata (DFSA).The algorithm makes full use of failure information during the pattern matching and skips as many characters as possible.The characteristics of this algorithm provide a powerful software sustentation for multicondition search of modern network search engines.The actual tests show that the proposed algorithm can effectively ameliorate the performance of network search engines.