Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. Bhutta, Calculating Aggregates with Range-Encoded Bit-Sliced Index, School of Computer Science, University of Windsor, Canada, 2002, http://cs.uwindsor.ca
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–226
M.-C. Wu, Query Optimization for Selections Using Bitmaps. In Proc. of the ACM SIGMOD Conference on Management of Data, 1999, pages 227–238.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhutta, K. (2002). Calculating Aggregates with Range-Encoded Bit-Sliced Index. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-45675-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44025-3
Online ISBN: 978-3-540-45675-9
eBook Packages: Springer Book Archive