摘要
传统基于字典的保序字符串压缩方法对数据的压缩和解压时间较长。为此,对编码索引CS-Prefix-Tree进行改进,根据字符串出现的概率,设计一种新的解码索引,从而减少查找时间,提高压缩性能。实验结果表明,与传统方法相比,改进方法的创建时间减少1/3,较大地降低内存消耗,查找时间降低近30%。
Data compression and decompression for traditional dictionary-based order-preserving string compression method has the shortcoming of long waiting time,so this paper improves CS-Prefix-Tree to reduce high memory consumption and time consuming while creating coding index.According to the probability of strings,it re-designs the decoding index to reduce its retrieving time.Experimental results demonstrate that the improvements reduces the creating time by 1/3,saves the memory consumption,and reduces the searching time by nearly 30%.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第21期58-60,67,共4页
Computer Engineering
关键词
字符串压缩
共用叶子
字典
编码索引
解码索引
string compression
shared leaves
dictionary
encoding index
decoding index
