Abstract
HIBASE compression technique simply replaces the attribute values in a tuple with fixed length code-words. However, fixed length coding system is not an optimal compression technique because some redundancies occur in the compressed table. This redundancy can be avoided if we use Huffman code-words. Moreover, using Huffman code-word will ensure optimal compression as well as high performance operation. The objectives of the research are to i) develop a dictionary by applying the principle of Huffman coding, ii) compress the relational storage of HIBASE by applying dynamic Huffman coding, iii) develop algorithm to perform query operation on the compressed storage, iv) analyze the performance of the proposed system in terms of both storage and queries. The main contribution of this research is to develop a compression technique. It implies the enhancement of HIBASE technique using HUFFMAN coding (H-HIBASE) with better compression capability.
Published Version
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