Skip to main content
SpringerLink
Log in

Bitmap-Based Index Structures

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 55 Accesses

Synonyms

Bitmap Index; Projection Index

Definition

A bitmap-based index is a binary vector that represents an interesting property and indicates which objects in the dataset satisfy the given property. The vector has a 1 in position i if the i-th data object satisfies the property, and 0 otherwise. Queries are executed using fast bitwise logical operations supported by hardware over the binary vectors.t

Historical Background

Bitmap-based indexing was first implemented in Computer Corporation of America’s Model 204 in the mid-1980s by Dr. Patrick O’Neil. The bitmap index from Model 204 was a hybrid between verbatim (uncompressed) bitmaps and RID lists. Originally, a bitmap was created for each value in the attribute domain. The entire bitmap index is smaller than the original data as long as the number of distinct values is less than the number of bits used to represent the attribute in the original data. For example, if an integer attribute has cardinality 10 and integers are stored...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Antoshenkov G. Byte-aligned bitmap compression. In: Data Compression Conference, Oracle Corp; 1995.

    Google Scholar 

  2. Apaydin T, Canahuate G, Ferhatosmanoglu H, Tosun A. Approximate encoding for direct access and query processing over compressed bitmaps. In: Proceedings of the 32nd International Conference on Very Large Data Bases; 2006.

    Google Scholar 

  3. Canahuate G, Gibas M, Ferhatosmanoglu H. Update conscious bitmap indices. In: Proceedings of the 19th International Conference on Scientific and Statistical Database Management; 2007.

    Google Scholar 

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

    Google Scholar 

  5. Chan CY, Ioannidis YE. An efficient bitmap encoding scheme for selection queries. ACM SIGMOD Rec. 1999.

    Google Scholar 

  6. Johnson D, Krishnan S, Chhugani J, Kumar S, Venkatasubramanian S. Compressing large boolean matrices using reordering techniques. In: Proceedings of the 30th International Conference on Very Large Data Bases; 2004.

    Google Scholar 

  7. Koudas N. Space efficient bitmap indexing. In: Proceedings of the International Conference on Information and Knowledge Management; 2000.

    Google Scholar 

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

    Google Scholar 

  9. Pinar A, Tao T, Ferhatosmanoglu H. Compressing bitmap indices by data reorganization. In: Proceedings of the 21st International Conference on Data Engineering; 2005.

    Google Scholar 

  10. Rotem D, Stockinger K, Wu K. Optimizing candidate check costs for bitmap indices. In: Proceedings of the International on Information and Knowledge Management; 2005.

    Google Scholar 

  11. Rotem D, Stockinger K, Wu K. Minimizing I/O costs of multi-dimensional queries with bitmap indices. In: Proceedings of the 18th International Conference on Scientific and Statistical Database Management; 2006.

    Google Scholar 

  12. Sinha R, Winslett M. Multi-resolution bitmap indexes for scientific data. ACM Trans Database Syst. 2007;32:16.

    Google Scholar 

  13. Stockinger K. Design and implementation of bitmap indices for scientific data. In: Proceedings of the International Conference on Database Engineering and Applications; 2001.

    Google Scholar 

  14. Stockinger K, Wu K, Shoshani A. Evaluation strategies for bitmap indices with binning. In: Proceedings of the 15th International Conference on Database and Expert Systems Applications; 2004.

    Google Scholar 

  15. Wong HK, Liu H, Olken F, Rotem D, Wong L. Bit transposed files. In: Proceedings of the 11th International Conference on Very Large Data Bases; 1985.

    Google Scholar 

  16. Wu M-C, Buchmann A. Encoded bitmap indexing for data warehouses. In: Proceedings of the 14th International Conference on Data Engineering; 1998.

    Google Scholar 

  17. Wu K, Otoo EJ, Shoshani A. On the performance of bitmap indices for high cardinality attributes. In: Proceedings of the 30th International Conference on Very Large Data Bases; 2004.

    Google Scholar 

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

    Google Scholar 

  19. Wu K, Stockinger K, Shoshani A. Breaking the curse of cardinality on bitmap indexes. In: Proceedings of the 20th International Conference on Scientific and Statistical Database Management; 2008.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Ohio State University, Columbus, OH, USA

    Guadalupe Canahuate & Hakan Ferhatosmanoglu

Authors
  1. Guadalupe Canahuate
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hakan Ferhatosmanoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guadalupe Canahuate .

Editor information

Editors and Affiliations

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

    Ling Liu

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

    M. Tamer Özsu

Section Editor information

  1. San Diego Supercomputer Center, Univ. of California San Diego, 9500 Gilman Drive, 92093-0505, La Jolla, CA, USA

    Amarnath Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Canahuate, G., Ferhatosmanoglu, H. (2016). Bitmap-Based Index Structures. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1282-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_1282-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation