Dynamic data organization for bitmap indices

  • Authors:

  • Tan Apaydin;Hakan Ferhatosmanoglu;Guadalupe Canahuate;Ali Şaman Tosun

  • Affiliations:

  • The Ohio State University;The Ohio State University;The Ohio State University;University of Texas at San Antonio

  • Venue:
  • Proceedings of the 3rd international conference on Scalable information systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Bitmap indices have been successfully used in scientific databases and data warehouses. Run-length encoding is commonly used to generate smaller size bitmaps that do not require explicit decompression for query processing. For static data sets, compression is shown to be greatly improved by data reordering techniques that generate longer and fewer runs. However, these data reorganization methods are not applicable to dynamic and very large data sets because of their significant overhead. In this paper, we present a dynamic data structure and algorithm for organizing bitmap indices for better compression and query processing performance. Our scheme enforces a compression rate close to the optimum for a target ordering of the data which results in fast query response time. For our experiments, we use Gray code ordering as the tuple ordering strategy. However, the proposed scheme efficiently works for any desired ordering strategy. Experimental results show that the proposed framework provides better compression and query execution time than the traditional approaches.