A Complete Suffix Array-Based String Match Search Algorithm of Sliding Windows

String match has been widely used in such diverse areas as data compression, search engine, information retrieval. Due to its simplicity and high-efficient space, suffix array is used to improve the efficiency of string match. However, the existing suffix array-based algorithms will rebuild suffix array after window slides every time. According to the properties of sliding window, the concept of completed suffix array and a new sliding window search algorithm for string matching using the orderly construction of suffix arrays are proposed. Thus, it is unnecessary that suffix array is rebuilt every time. Both theoretical analysis and experimental results show the improved efficiency of the proposed algorithm.