For storing a word or the whole text segment, we need a huge storage space. Typically a character requires 1 Byte for storing it in memory. Compression of the memory is very important for data management. In case of memory requirement compression for text data, lossless memory compression is needed. We are suggesting a lossless memory requirement compression method for text data compression. The proposed compression method will compress the text segment or the text file based on two level approaches firstly reduction and secondly compression. Reduction will be done using a word lookup table not using traditional indexing system, then compression will be done using currently available compression methods. The word lookup table will be a part of the operating system and the reduction will be done by the operating system. According to this method each word will be replaced by an address value. This method can quite effectively reduce the size of persistent memory required for text data. At the end of the first level compression with the use of word lookup table, a binary file containing the addresses will be generated. Since the proposed method does not use any compression algorithm in the first level so this file can be compressed using the popular compression algorithms and finally will provide a great deal of data compression on purely English text data.
[1]
G.G. Langdon,et al.
Data compression
,
1988,
IEEE Potentials.
[2]
Roberto Grossi,et al.
High-order entropy-compressed text indexes
,
2003,
SODA '03.
[3]
Frederic P. Miller,et al.
Operating System
,
2020,
Essential Computer Science.
[4]
Abraham Lempel,et al.
A universal algorithm for sequential data compression
,
1977,
IEEE Trans. Inf. Theory.
[5]
James Shaw.
Conciseness through Aggregation in Text Generation
,
1995,
ACL.
[6]
Frank Rubin,et al.
Experiments in text file compression
,
1976,
CACM.
[7]
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA
,
2003,
SODA.
[8]
Henry McGilton,et al.
Introducing UNIX System V
,
1987
.
[9]
Bruce Hahn,et al.
A new technique for compression and storage of data
,
1974,
Commun. ACM.
[10]
Deitel.
Operating System
,
2008
.
[11]
David A. Huffman,et al.
A method for the construction of minimum-redundancy codes
,
1952,
Proceedings of the IRE.
[12]
Craig Stanfill,et al.
Compression of indexes with full positional information in very large text databases
,
1993,
SIGIR.