| dc.description.abstract |
Improving the query performance is critical in data warehousing and decision support systems. A lot of methods have been proposed by various researches. Indexing the data warehouse is a common but effective technique. Bitmap indices play a very important role in improving query performance in data warehousing and decision support systems. In this paper we present a new bitmap indexing strategy that can be applied to any existing bitmap compression schemes that are based on run length encoding. The new strategy, in most cases, requires less space and provides performance gains as well. The new strategy is tested on two commonly used bitmap compression schemes namely, word-aligned hybrid (WAH) and byte-aligned bitmap code (BBC) and results are presented graphically. The proposed strategy simply sorts the field on which a bitmap is to be created. Sorting of the field ensures long runs of ones and zeros. These long runs of ones and zeros are desirable for any compression scheme that is based on run length encoding and its variants. The space required to store the bitmap indexes goes down dramatically. The effect of sorting on query response time is studied for equality and range queries and it is found that there is a considerable decrease in the response time of queries. The overheads associated with the proposed strategy are sorting a table on a particular field and maintaining a sorted table. These extra tasks could be easily performed during the ETL process or when the data warehouse is offline. The new strategy concentrates on reducing space requirement for the bitmap index and the response time of queries and achieves both objectives without incurring any processing overheads when the data warehouse is online. |
en_US |