Article

A performance comparison of bitmap indexes

Authors:

Kesheng Wu,

Ekow J. Otoo,

Arie ShoshaniAuthors Info & Claims

CIKM '01: Proceedings of the tenth international conference on Information and knowledge management

Pages 559 - 561

https://doi.org/10.1145/502585.502689

Published: 05 October 2001 Publication History

Get Access

Abstract

We present a comparison of two new word-aligned schemes with some schemes for compressing bitmap indexes, including the well-known byte-aligned bitmap code (BBC). On both synthetic data and real application data, the new word-aligned schemes use only 50% more space, but perform logical operations on compressed data 12 times faster than BBC. The new schemes achieve this performance advantage by guaranteeing that during logical operations every machine instruction performs useful work on words rather than on bytes or bits as in BBC.

References

[1]

G. Antoshenkov and M. Ziauddin. Query processing and optimization in ORACLE RDB. The VLDB Journal, 5:229-237, 1996.

Digital Library

Google Scholar

[2]

T. Johnson. Performance measurements of compressed bitmap indices. In VLDB'99, 1999. Pages 278-289.

Digital Library

Google Scholar

[3]

A. Shoshani, L. M. Bernardo, H. Nordberg, D. Rotem, and A. Sim. Multidimensional indexing and query coordination for tertiary storage management. In SSDBM'99. Pages 214-225. 1999.

Digital Library

Google Scholar

[4]

K. Wu, E. J. Otoo, and A. Shoshani. Word-aligned compressed bitmaps. Technical Report LBNL-47807, Lawrence Berkeley National Laboratory, Berkeley, CA, 2001.

Google Scholar

[5]

K. Wu, E. J. Otoo, A. Shoshani, and H. Nordberg. Notes on design and implementation of compressed bit vectors. Technical Report LBNL/PUB-3161, Lawrence Berkeley National Laboratory, Berkeley, CA, 2001.

Google Scholar

Cited By

View all

DeHaas DPan ZWei X(2024)Enabling efficient analysis of biobank-scale data with genotype representation graphsNature Computational Science10.1038/s43588-024-00739-95:2(112-124)Online publication date: 5-Dec-2024
https://doi.org/10.1038/s43588-024-00739-9
Koo GOh YTseng HRo WAnnavaram M(2023)FLIXR: Embedding Index Into Flash Translation Layer in SSDsIEEE Transactions on Computers10.1109/TC.2022.315460272:1(250-263)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TC.2022.3154602
Abderrahim EMatta NAtifi H(2022)Know-linking: When Machine Learning Meets Organizational Tools Analysis to Generate Shared Knowledge in Large CompaniesHandbook on Artificial Intelligence-Empowered Applied Software Engineering10.1007/978-3-031-07650-3_5(71-88)Online publication date: 18-Oct-2022
https://doi.org/10.1007/978-3-031-07650-3_5
Show More Cited By

Index Terms

A performance comparison of bitmap indexes
1. Applied computing
  1. Document management and text processing
    1. Document capture
      1. Document analysis
2. Information systems
  1. Information retrieval

Recommendations

Analyses of multi-level and multi-component compressed bitmap indexes

Bitmap indexes are known as the most effective indexing methods for range queries on append-only data, and many different bitmap indexes have been proposed in the research literature. However, only two of the simplest ones are used in commercial ...
Inverted indexes vs. bitmap indexes in decision support systems
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge management

Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted query processing strategies from Information Retrieval as an alternative. In a ...
Compressing Bitmap Indexes for Faster Search Operations
SSDBM '02: Proceedings of the 14th International Conference on Scientific and Statistical Database Management

In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, NOT, etc. Using the general purpose compression schemes, such as gzip, the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CIKM '01: Proceedings of the tenth international conference on Information and knowledge management

October 2001

616 pages

ISBN:1581134363

DOI:10.1145/502585

Editors:
Henrique Paques
Georgia Institute of Technology
,
Ling Liu
Georgia Institute of Technology
,
David Grossman
Illinois Institute of Technology
,
General Chair:
Calton Pu
Georgia Institute of Technology

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 October 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM01

Sponsor:

CIKM01: International Conference on Information and Knowledge Management

October 5 - 10, 2001

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
1,382
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)1

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

DeHaas DPan ZWei X(2024)Enabling efficient analysis of biobank-scale data with genotype representation graphsNature Computational Science10.1038/s43588-024-00739-95:2(112-124)Online publication date: 5-Dec-2024
https://doi.org/10.1038/s43588-024-00739-9
Koo GOh YTseng HRo WAnnavaram M(2023)FLIXR: Embedding Index Into Flash Translation Layer in SSDsIEEE Transactions on Computers10.1109/TC.2022.315460272:1(250-263)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TC.2022.3154602
Abderrahim EMatta NAtifi H(2022)Know-linking: When Machine Learning Meets Organizational Tools Analysis to Generate Shared Knowledge in Large CompaniesHandbook on Artificial Intelligence-Empowered Applied Software Engineering10.1007/978-3-031-07650-3_5(71-88)Online publication date: 18-Oct-2022
https://doi.org/10.1007/978-3-031-07650-3_5
Tanted SAgarwal AMitra SBahuman CRamamritham KVarma VKambhampati SBhattacharya ANatarajan SRoy R(2020)Database and Caching Support for Adaptive Visualization of Large Sensor DataProceedings of the 7th ACM IKDD CoDS and 25th COMAD10.1145/3371158.3371170(98-106)Online publication date: 5-Jan-2020
https://dl.acm.org/doi/10.1145/3371158.3371170
Wu GGu JDai J(2017)A Survey of Techniques for the Representation of Very Large Access Control MatricesFrontier Computing10.1007/978-981-10-3187-8_8(67-77)Online publication date: 27-Sep-2017
https://doi.org/10.1007/978-981-10-3187-8_8
Vallentin MPaxson VSommer RArgyraki KIsaacs R(2016)VASTProceedings of the 13th Usenix Conference on Networked Systems Design and Implementation10.5555/2930611.2930634(345-362)Online publication date: 16-Mar-2016
https://dl.acm.org/doi/10.5555/2930611.2930634
Wu GTompa FWang XBauer LKerschbaum F(2016)A Space-Efficient Data Structure for Fast Access Control in ECM SystemsProceedings of the 21st ACM on Symposium on Access Control Models and Technologies10.1145/2914642.2914657(191-201)Online publication date: 6-Jun-2016
https://dl.acm.org/doi/10.1145/2914642.2914657
Guzun GCanahuate G(2016)Performance evaluation of word-aligned compression methods for bitmap indicesKnowledge and Information Systems10.1007/s10115-015-0877-948:2(277-304)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1007/s10115-015-0877-9
Guzun GCanahuate G(2016)Hybrid query optimization for hard-to-compress bit-vectorsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-015-0419-925:3(339-354)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s00778-015-0419-9
Liu YDai HWang FDai WDeng H(2015)Efficient Indexing and Querying of Massive Astronomical Data Using Compressed Word-Aligned Hybrid Bitmap2015 IEEE International Conference on Systems, Man, and Cybernetics10.1109/SMC.2015.277(1567-1572)Online publication date: Oct-2015
https://doi.org/10.1109/SMC.2015.277
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Analyses of multi-level and multi-component compressed bitmap indexes

Inverted indexes vs. bitmap indexes in decision support systems

Compressing Bitmap Indexes for Faster Search Operations

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations