Calculating Aggregates with Range-Encoded Bit-Sliced Index
This paper proposes, for query optimizing on Data warehouses, the use of range-encoded bitmap index to calculate aggregates. By using space optimal range-encoded bitmap index for range and aggregate predicates, the need of separate indexes for these operations can be eliminated. The proposed algorithm also uses the population ratio of 1’s in a bitmap to decide whether the bitmap has to be scanned from the disk at all; thus exploiting the opportunity of skipping many bitmap scans since processing them does not affect the solution. These optimizations result in significant improvement in query evaluation time.
Unable to display preview. Download preview PDF.
- 2.C. Y. Chan, Y. E. Ioannidis, An Efficient Bitmap Encoding Scheme for Selection Queries. In Proc. of the ACM SIGMOD Conference on Management of Data, 1999, pages 215–226Google Scholar
- 3.M.-C. Wu, Query Optimization for Selections Using Bitmaps. In Proc. of the ACM SIGMOD Conference on Management of Data, 1999, pages 227–238.Google Scholar
- 4.C-Y. Chan and Y. E. Ioannidis, Bitmap Index Design and Evaluation,. In Proc. of the ACM SIGMOD Conference on Management of Data, 1998, pages 355–366.Google Scholar
- 5.P. O’Neil and D. Quass, Improved query performance with variant indexes. Proc. ACM SIGMOD Intl. Conference on Management of Data, 1997, Pages 38–49.Google Scholar