Evaluation Strategies for Bitmap Indices with Binning

  • Kurt Stockinger
  • Kesheng Wu
  • Arie Shoshani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3180)


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.


Evaluation Strategy Query Condition Query Response Time Candidate Selectivity Projection Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chaudhuri, S., Dayal, U.: An Overview of Data Warehousing and OLAP Technology. ACM SIGMOD Record 26(1) (March 1997)Google Scholar
  2. 2.
    Chan, C., Ioannidis, Y.E.: Bitmap Index Design and Evaluation. In: SIGMOD 1998, Seattle, Washington, USA, June 1998, ACM Press, New York (1998)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Johnson, T.: Performance Measurements of Compressed Bitmap Indices. In: VLDB 1999, Edinburgh, Scotland, UK, September 1999, Morgan Kaufmann, San Francisco (1999)Google Scholar
  5. 5.
    O’Neil, P., Quass, D.: Improved Query Performance With Variant Indices. In: SIGMOD 1997, Tucson, Arizona, USA, May 1997, ACM Press, New York (1997)Google Scholar
  6. 6.
    Shoshani, A., Bernardo, L.M., Nordberg, H., Rotem, D., Sim, A.: In: SSDBM 1999, July 1999, IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Kurt Stockinger
    • 1
  • Kesheng Wu
    • 1
  • Arie Shoshani
    • 1
  1. 1.Lawrence Berkeley National LaboratoryBerkeleyUSA

Personalised recommendations