一种后缀数组与滑动窗口结合的压缩算法

摘要

现有的基于后缀数组的滑动窗口压缩算法,在每次窗口滑动后都需要重新构建后缀数组,影响了算法的效率.在分析了滑动窗口下后缀数组的特点后,提出一种构建后缀数组的新方法,使得在压缩算法执行过程中只需要部分构建后缀数组,在不损失压缩效率的情况下,使得整个压缩算法的效率得到提高.实验验证了提出算法的有效性.%The existing suffix array-based sliding window compression algorithms are inefficient since they will rebuild suffix array for dictionary window after each sliding window. To solve the problem, after analyzing the characteristics of the suffix array in sliding window, a new method of building a suffix array is proposed. Based on the new method, the suffix array just need be rebuilt partly during the execution of the algorithm which makes the efficiency of the presented algorithm improved, and meantime, the compression rate of the algorithm can be maintained. The experiment results show the effectiveness of the proposed algorithm.