计算机工程2011，Vol.37Issue(21)：58-60,67,4.DOI:10.3969/j.issn.1000-3428.2011.21.020
基于字典的保序字符串压缩改进方法
Improved Order-preserving String Compression Method Based on Dictionary
李海燕 1夏小玲1
作者信息
- 1. 东华大学计算机科学与技术学院,上海201620
- 折叠
摘要
Abstract
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%.关键词
字符串压缩/共用叶子/字典/编码索引/解码索引Key words
string compression/shared leaves/dictionary/encoding index/decoding index分类
信息技术与安全科学引用本文复制引用
李海燕,夏小玲..基于字典的保序字符串压缩改进方法[J].计算机工程,2011,37(21):58-60,67,4.
