The week's pick
Random Articles
Reseach Article
An Efficient Text Database Compression Technique using 6 Bit Character Encoding by Table Look Up
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 180 - Number 4 |
| Year of Publication: 2017 |
| Authors: Md. Ashiq Mahmood, Tarique Latif, Md. Riadul Islam |
10.5120/ijca2017915998
|
Md. Ashiq Mahmood, Tarique Latif, Md. Riadul Islam . An Efficient Text Database Compression Technique using 6 Bit Character Encoding by Table Look Up. International Journal of Computer Applications. 180, 4 ( Dec 2017), 11-18. DOI=10.5120/ijca2017915998
Abstract
Character encoding determines a term which represents a repertoire of characters by some kind of encoding technique. It covers a huge area of applications such as data communication, storage of data, textual data transmission and database technology. In this paper, a new technique of compression for text data is proposed which encodes a character by 6 bits namely 6 - Bit Encoding (6BE). Actually the working method of this technique is encoding an 8 bit character by 6 bits. This technique works with the characters which are printable. For encoding a character to 6 bit, it uses a lookup table. Firstly, it divides the characters into 4 sets and then it uses the location of characters uniquely to encode by 6 bits. By this procedure 8 bit characters are converted into 6 bits by this 6BE technique. At First, this technique on simple text. It is found that, the 6BE technique can able to compress the original text by 25%. After that this 6BE technique is used in proper database technology by compressing the text data in a table of a database. The 6BE is able to compress as well as decompress the original data with the help a lookup table. The reverse technique is also detailed for decompression to get back the original table. The outcome of 6BE technique is also applied to compress again by the known algorithm Huffman and LZW. The experimental result shows promising performance. The technique is further discussed by some examples and descriptions.
References
- Ashiq Mahmood , Tarique Latif and K. M. Azharul Hasan, “An Efficient 6 bit Encoding Scheme for Printable Characters by table look up”, International Conferenceon Electrical, Computer and Communication Engineering (ECCE), pp. 468-472, 2017.
- DwiSuarjaya. “A New Algorithm for Data Compression Optimization,”(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 3(8), 14- 24, 2012.
- Senthil Shanmuga sundaram, and Robert Lourdusamy, “A Comparative Study Of Text Compression Algorithms,”International Journal of Wisdom Based Computing, Vol.1 (3), pp. 68-76, 2011
- Hussein Al-Bahadili, and Shakir M. Hussain, “A Bit-level Text Compression Scheme Based on the ACW Algorithm,” International Journal of Automation and Computing, 7(1), pp.123-131,2010.
- A Carus, and A Mesut, “Fast text compression using multiple static dictionaries,” Information Technology Journal, 1013-1021, 2010.
- Alessio Langiu. “On parsing optimality for dictionary- based text compression,” Journal of Discrete Algorithms, 65-70, 2013.
- Capo-chichi, E. P., Guyennet, H. and Friedt, J. K-RLE, “a New Data Compression Algorithm for Wireless Sensor Network,” In Proceedings Third International Conference on Sensor Technologies and Applications, pp.502-507, 2009.
- Muthukumar Murugesan, T. Ravichandran, “Evaluate Database Compression Performance and Parallel Backup,” International Journal of Database Management Systems (IJDMS) Vol.5(4), 17-25, 2013.
- Amit Jain, Kamaljit I. Lakhtaria, “Comparetive Study of Dictionary Based Compression Algorithms on Text Data”, Proceedings of the Data Compression Conference, IEEE Computer Society, 2009.
- Ahmad Affandi, Saparudin, and Erwin, “The application of text compression to short message service using huffman table”Vol.6 No.1 Journal Generic, 19-24, 2011.
- Asadollah Shahbahrami, Ramin Bahrampour, Mobin Sabbaghi Rostami, Mostafa Ayoubi Mobarhan, “Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards,” International Journal of Computer Science, Engineering and Applications (IJCSEA) Volume 1, Number 4, 2011.
- Mamta Sharma, “Compression Using Huffman Coding”, IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.5, May 2010.
- SR Kodituwakku, US Amarasinghe, “Comparison of lossless data compression algorithms for text data,” S.R. Kodituwakkuet. al. / Indian Journal of Computer Science and Engineering ,2012,Vol 1 No 4 416-426.
- Si-huiShu, Yi Shu, “A Two-Stage Data Compression Method For Real-time Database”, 3rd International Conference on System Science, Engineering Design and Manufacturing, DOI 10.1109/ICSSEM.2012.6340844, 2012.
- R Naqvi, RA Riaz, F Siddiqui, “Optimized RTL design and implementation of LZW algorithm for high bandwidth applications,” Electrical Review, 279-285, 2011.
- Zhou Yan-li, Fan Xiao-ping, Liu Shao-qiang, XiongZhe- yuan,“Improved LZW algorithm of lossless data compression for WSN”, 3rd IEEE International Conference on Computer Science and Information Technology, 2010 DOI 10.1109/ICCSIT.2010.5563620, 2010.
- SushilaAghav, “ Database compression techniques for performance optimization, 2nd International Conference on Computer Engineering and Technology (ICCET),10.1109/ICCET.2010.5485951, 2010”.
- Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad and S. M. Kamruzzaman, “An Efficient Technique for Text Compression” The 1st International Conference onInformation Management and Business, pp. 467-473, 2005.
- Pujar, J.H.; Kadlaskar, L.M. "A New Lossless Method of Image Compression and Decompression Using Huffman Coding Techniques", Journal of Theoretical and Applied Information Technology. 15 (1), pp.18–23, 2010.
- M Garcia, P Gamallo, “Dependency-based text compression for semantic relation extraction” The 8th International Conference on Recent Advances in Natural Language Processing, 21-28, 2011.
Index Terms
Keywords