Sharing initial dictionaries and huffman trees between multiple compressed blocks in LZ-based compression algorithms

A string of data is partitioned into a set of blocks. Each block is compressed based on a set of initial dictionaries and a set of Huffman trees. Each block is associated by a pointer with an initial dictionary in the set of initial dictionaries and a Huffman tree in the set of Huffman trees used to compress that block. A compressed string of data includes the set of initial dictionaries, the set of Huffman trees, and the compressed blocks and associated pointers. 将数据字符串分割成块集。基于初始词典集和霍夫曼树集压缩每块。每块通过指针与所述初始词典集中的初始字典和所述霍夫曼树集中的霍夫曼树相关联，所述初始字典和所述霍夫曼树用以压缩所述块。经压缩数据字符串包含所述初始词典集、所述霍夫曼树集以及所述经压缩块和相关联指针。