Patent ID: 8037035

Claim:
A computer-readable, non-transitory medium storing therein an information managing program that causes a master server accessible to a plurality of slave servers that each stores therein a compressed file group including compressed files that are to be searched and that described therein character strings, to execute: receiving the compressed file group from each of the slave servers; expanding, each of the compressed file groups using a Huffman tree that is based on an appearance frequency of each character in each of the compressed file groups and that was used for compressing the compressed file group; generating, based on the appearance frequency, a common compression parameter that is common to the compressed file groups by summing, for each character, the appearance frequency of each of the compressed file groups; generating a common Huffman tree that is common to the compressed file groups, based on the common compression parameter; recompressing, using the common Huffman tree, expanded files expanded at the expanding; allocating re-compressed files recompressed at the recompressing to the slave servers such that sums of the access frequencies of the compressed files that are origins of the recompressed files are substantially equivalent among the slave servers; and transmitting new archives including the re-compressed files allocated to the slave servers at the allocating and the common Huffman tree to the slave servers, respectively.