Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (15): 59-62.

Previous Articles     Next Articles

Sliding window compression algorithm based on suffix array

ZHAO Youqiao1, WANG Jian1, LU Songfeng1, XU Yongkang2   

  1. 1.School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
    2.Institute of Computer Application Technology, China Academy of Engineering Physics, Mianyang, Sichuan 621900, China
  • Online:2012-05-21 Published:2012-05-30

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

赵友桥1,王  坚1,路松峰1,胥永康2   

  1. 1.华中科技大学 计算机科学与技术学院,武汉 430074
    2.中国工程物理研究院 计算机应用研究所,四川 绵阳 621900

Abstract: 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.

Key words: data compression, sliding window, suffix array

摘要: 现有的基于后缀数组的滑动窗口压缩算法,在每次窗口滑动后都需要重新构建后缀数组,影响了算法的效率。在分析了滑动窗口下后缀数组的特点后,提出一种构建后缀数组的新方法,使得在压缩算法执行过程中只需要部分构建后缀数组,在不损失压缩效率的情况下,使得整个压缩算法的效率得到提高。实验验证了提出算法的有效性。

关键词: 数据压缩, 滑动窗口, 后缀数组