Journal
JOURNAL OF COMPUTERS
Volume 8, Issue 5, Pages 1175-1183Publisher
ACAD PUBL
DOI: 10.4304/jcp.8.5.1175-1183
Keywords
data compression; database compression; HIBASE; Huffman; variable length coding
Ask authors/readers for more resources
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 codeword 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available