Earticle

초록

영어

In this paper we have presented a loss-less compression technique namely H-HIBASE (compression enhancement of HIBASE technique using Huffman Coding). Due to disk based compression, H-HIBASE supports 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. We have 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.

목차

Abstract
 1. Introduction
  1.1. Background
  1.2. Objectives
  1.3. Research Approach and Methodology
  1.4. Storage Complexity
 2. H-HIBASE: Implementation
  2.1. H-HIBASE Dictionary
  2.2. H-HIBASE: Encoding
  2.3. Query Operation: Selection
  2.4. Query Operation: Insertion
  2.5. Query Operation: Deletion
  2.6. Query Operation: Update
  2.7. Query Operation: Aggregate Function
 3. Result and Discussion
  3.1. Storage Requirement
  3.2. Query Performance
 4. Conclusions
  4.1. Fundamental Contributions of the Research
 References

키워드

저자

• Ahsan Habib [ Department of CSE, Metropolitan University, Sylhet, Bangladesh ]
• A. S. M. Latiful Hoque [ Department of CSE, Bangladesh University of Engineering and Technology Dhaka, Bangladesh ]
• Muhammad Shahidur Rahman [ Department of CSE, Shah Jalal University of Science and Technology Sylhet, Bangladesh ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605