A new general purpose compression method for searching in large collection

Reduction of both compression ratio and retrieval of data from large collection is important in any computation requiring human interface. In this paper, a new algorithm is proposed for general purpose compression scheme that can be applied to all types of data storage in large collections. The paper presents a fast compression and decompression technique for natural language texts. The technique used in compressing text allows searching phrase in the compressed form without decompressing the compressed file. The algorithm suggested here uses static dictionary in matrix form, which reduces the compression and decompression time. The memory requirement of the algorithm is almost negligible.