Compression enhancement of HIBASE technique using HUFFMAN coding

Abstract

Storage requirement for database system is a problem for many years. Storage capacity is being increased continually, but the enterprise and service provider data need double storage every six to twelve months. It is a challenge to store and retrieve this increased data in an efficient way. Reduction of the data size without losing any information is known as loss-less data compression. In this thesis we have presented a loss-less compression technique namely HHIBASE (further compression of HIBASE technique using HUFFMAN Coding). Due to disk based compression H-HIBASE support very large database with acceptable storage volume. Insertion, deletion and update mechanisms on the architecture have been presented and analyzed. The architecture executes query directly on compressed data and it is capable of executing all types of SQL queries. The experimental evaluation has been performed with synthetic and real data. The experimental result has been compared with DHIBASE and widely used Oracle database. Our target was to handle relations and justify the storage requirements and query time in comparison with DHIBASE and Oracle database. We evaluated the storage performance in comparison with DHIBASE and Oracle database. The storage performance that has been achieved in H-HIBASE is 25 to 40 percent better than the Oracle database for real and synthetic data. The query performance that has been achieved in H-HIBASE is 10 to 25 percent better than that of DHIBASE.