Map and Trie based Compression Algorithm for Data Transmission

In-text compression algorithms, a set of symbols as alphabets are defined. These alphabets are the basic building blocks of the language. Traditionally 8-bit ASCII characters are chosen as alphabets. In this paper, an approach that chooses larger symbols as alphabets is proposed. For example, in the case of the English language, a set of words and special characters are chosen as alphabets. In the case of HTML documents, HTML tags are included along with alphabets from the English language described before. Better compression results can be achieved since words have larger byte size than individual ASCII characters but still get mapped to similar-sized encodings. Compressing the data to be transmitted across networks implies less usage of network bandwidth, faster transmission of data, sending several data files over a single transfer and faster reading and writing of data. Thus, the transmission of a compressed file is cost-effective and also saves time in communication. The results prove that the proposed approach gives better file size compression concerning the compression ratio when compared with state-of-the-art algorithms.