| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To improve efficiency in generating a compressed code map group by cooperation with a compression process. <P>SOLUTION: (1) The occurrence frequency of characters in a target file group Fs is calculated. (2) A 2<SP>n</SP>-branch Huffman tree H1 is generated from a result of the calculation 10. (3) The 2<SP>n</SP>-branch Huffman tree H1 is transformed into a 2<SP>m</SP>-branch nodeless Huffman tree H2. (4) Each file in the target file group Fs is read to search the nodeless Huffman tree for compressed codes. (5) Compressed codes found are arranged in files to compress the target file group Fs. (6) Concurrently, a compressed code map group Ms is generated. The compressed code map group Ms is used, thereby refining a compressed file group fs for characters constituting a search keyword without expanding it. <P>COPYRIGHT: (C)2011,JPO&INPIT</p> |
