Title: Comparative Analysis between Simple-Bitmap and Encoded-Bitmap Indexing Techniques for Data Warehousing
Authors: Abubakar Balarabe, Muhammad Muktar Tambuwal & Yusuf Abbas
Volume: 9
Issue: 5
Pages: 79-82
Publication Date: 2025/05/28
Abstract:
Bitmap indexing is a prominent technique in data warehousing for accelerating query performance, particularly for read-intensive operations. This study presents a comparative analysis between simple bitmap and encoded bitmap indexing techniques, with a focus on their performance during aggregated query operations utilizing logical OR and AND operations. The experiment involves implementing both indexing methods on a warehouse dataset and executing identical aggregate queries across multiple dimensions. Performance is evaluated in terms of query execution time, storage overhead, and indexing efficiency. Results indicate that while simple bitmap indexing provides faster response times for low-cardinality attributes due to its straightforward binary representation, encoded bitmap indexing demonstrates superior performance in handling higher-cardinality attributes by reducing the number of bitmaps required. The trade-off between index size and query evaluation speed is also examined. This comparative analysis aids in determining the appropriate bitmap indexing technique based on the cardinality and nature of the queries, contributing to the optimization of data warehouse performance.