Abstract
Bitmap indices are efficient data structures for querying read-only data with low attribute cardinalities. To improve the efficiency of the bitmap indices on attributes with high cardinalities, we present a new strategy to evaluate queries using bitmap indices. This work is motivated by a number of scientific data analysis applications where most attributes have cardinalities in the millions. On these attributes, binning is a common strategy to reduce the size of the bitmap index.
In this article we analyze how binning affects the number of pages accessed during query processing, and propose an optimal way of using the bitmap indices to reduce the number of pages accessed. Compared with two basic strategies the new algorithm reduces the query response time by up to a factor of two. On a set of 5-dimensional queries on real application data, the bitmap indices are on average 10 times faster than the projection index.
The authors thank Ekow Otoo, Doron Rotem, and Heinz Stockinger for their constructive comments during the writing of this article. This work was supported by the Director, Office of Science, Office of Laboratory Policy and Infrastructure Management, of the U.S. Department of Energy under Contract No. DE-AC03-76SF00098. This research used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chaudhuri, S., Dayal, U.: An Overview of Data Warehousing and OLAP Technology. ACM SIGMOD Record 26(1) (March 1997)
Chan, C., Ioannidis, Y.E.: Bitmap Index Design and Evaluation. In: SIGMOD 1998, Seattle, Washington, USA, June 1998, ACM Press, New York (1998)
Chan, C., Ioannidis, Y.E.: An Efficient Bitmap Encoding Scheme for Selection Queries. In: SIGMOD 1999, Philadelphia, Pennsylvania, USA, June 1999, ACM Press, New York (1999)
Johnson, T.: Performance Measurements of Compressed Bitmap Indices. In: VLDB 1999, Edinburgh, Scotland, UK, September 1999, Morgan Kaufmann, San Francisco (1999)
O’Neil, P., Quass, D.: Improved Query Performance With Variant Indices. In: SIGMOD 1997, Tucson, Arizona, USA, May 1997, ACM Press, New York (1997)
Shoshani, A., Bernardo, L.M., Nordberg, H., Rotem, D., Sim, A.: In: SSDBM 1999, July 1999, IEEE Computer Society Press, Los Alamitos (1999)
Stockinger, K.: Bitmap indices for speeding up high-dimensional data analysis. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, p. 881. Springer, Heidelberg (2002)
Stockinger, K., Wu, K., Shoshani, A.: Strategies for Processing ad-hoc Queries on Large Data Warehouses. In: DOLAP 2002, McLean, VA, USA, November 2002, ACM Press, New York (2002)
Wu, K., Koegler, W., Chen, J., Shoshani, A.: Using Bitmap Index for Interactive Exploration of Large Datasets. In: SSDBM 2003, July 2003, IEEE Computer Society Press, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stockinger, K., Wu, K., Shoshani, A. (2004). Evaluation Strategies for Bitmap Indices with Binning. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2004. Lecture Notes in Computer Science, vol 3180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30075-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30075-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22936-0
Online ISBN: 978-3-540-30075-5
eBook Packages: Springer Book Archive