分布式环境下的模式匹配算法

Pattern Matching is a very popular method in information pocessing. However, most pattern matching algorithm are proposed many years ago. Even though these algorithms are very effective, they are not proper for processing huge amount of data. These years, distributed computing becomes a basic approach to handle this. This paper will use this technology to improve the classic WM pattern matching algorithm and propose a pattern matching algorithm in distributed computing environment. This algoritm will take Map-Reduce features, spliting the processing into pieces of Map-Reduce jobs and making them work simultaneously. This paper will also compare the efficiency of this algorithm with that of the basic pattern matching algorithm, proving this algorithm is more effective.