Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 311–315Cite as

Bitmap Index

  • Reference work entry
  • First Online:

  • 85 Accesses

Definition

An index on an attribute provides an efficient way to access data records associated with a given range of values for the indexed attribute. Typically, an index stores a list of RIDs (called a RID-list) of all the records associated with each distinct value v of the indexed attribute. In a bitmap index, each RID-list is represented in the form of a bit vector (i.e., bitmap) where the size of each bitmap is equal to the cardinality of the indexed relation, and the i-th bit in each bitmap corresponds to the i-th record in the indexed relation. The simplest bitmap index design is the Value-List index, which is illustrated in Fig. 1b for an attribute A of a 12-record relation R in Fig. 1a. In this bitmap index, there is one bitmap Ev associated with each attribute value v ϵ [0,9] such that the i-th bit of Ev is set to 1 if and only if the i-th record has a value v for the indexed attribute.

Bitmap Index, Fig. 1
figure 219 figure 219

Examples of bitmap indexes. (a) indexed attribute A, (b)...

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Amer-Yahia S, Johnson T. Optimizing queries on compressed bitmaps. In: Proceedings of the 26th International Conference on Very Large Data Bases; 2000. p. 329–38.

    Google Scholar 

  2. Chan CY, Ioannidis YE. Bitmap index design and evaluation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 355–66.

    Google Scholar 

  3. Chan CY, Ioannidis YE. An efficient bitmap encoding scheme for selection queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1999. p. 215–26.

    Article  Google Scholar 

  4. Knuth DE. Retrieval on secondary keys. Chap. 6. In: The art of computer programming: sorting and searching, vol. 3. Reading: Addison-Wesley; 1973. p. 550–67.

    MATH  Google Scholar 

  5. Koudas N. Space efficient bitmap indexing. In: Proceedings of the International Conference on Information and Knowledge Management; 2000. p. 194–201.

    Google Scholar 

  6. O’Neil P, Graefe G. Multi-table joins through bitmapped join indices. ACM SIGMOD Record. 1995;24(3)8–11.

    Article  Google Scholar 

  7. O’Neil P, Quass D. Improved query performance with variant indexes. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 38–49.

    Google Scholar 

  8. Reinfret D, O’Neil P, O’Neil E. Bit-sliced index arithmetic. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001. p. 47–57.

    Google Scholar 

  9. Sinha R, Winslett M. Multi-resolution bitmap indexes for scientific data. ACM Trans Database Syst. 2007;32(3):1–39.

    Article  Google Scholar 

  10. Wong HKT, Liu H-F, Olken F, Rotem D, Wong L. Bit transposed files. In: Proceedings of the 11th International Conference on Very Large Data Bases; 1985. p. 448–57.

    Google Scholar 

  11. Wu MC. Query optimization for selections using nitmaps. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1999. p. 227–38.

    Google Scholar 

  12. Wu MC, Buchmann AP. Encoded bitmap indexing for data warehouses. In: Proceedings of the 14th International Conference on Data Engineering; 1998. p. 220–30.

    Google Scholar 

  13. Wu KL, Yu PS. Range-based bitmap indexing for high cardinality attributes with skew. Technical report, IBM Watson Research Center. 1996.

    Google Scholar 

  14. Wu K, Otoo EJ, Shoshani A. Optimizing bitmap indices with efficient compression. ACM Trans Database Syst. 2006;31(1):1–38.

    Article  Google Scholar 

  15. Wu K, Shoshani A, Stockinger K. Analyses of multi-level and multi-component compressed bitmap indexes. ACM Trans Database Syst. 2010;35(1): 1–52.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National University of Singapore, Singapore, Singapore

    Chee-Yong Chan

Authors
  1. Chee-Yong Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chee-Yong Chan .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. University of California-Riverside, Riverside, MA, USA

    Vassilis J. Tsotras

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Chan, CY. (2018). Bitmap Index. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_749

Download citation

Publish with us

Policies and ethics

Search

Navigation