An Improved Algorithm Based on the Suffix WM Matching Algorithm

With regard to the problem of the repeated matching in WM algorithm based on suffix matching,an improved algorithm is proposed in this paper.When the algorithm detects that the text string has the same prefix,suffix,and suffix of the former m character as the pattern string,during the matching stage,the algorithm would skip the located blocks which have been confirmed in the scanning.Which avoid repeatedly matching the confirmed blocks,reducing the matching overhead.The tested results show that,compared with the original algorithm,the improved algorithm reduces the matching time,and improves the efficiency of the system.