Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.