Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An efficient bitmap encoding scheme for selection queries
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A performance comparison of bitmap indexes
Proceedings of the tenth international conference on Information and knowledge management
Encoded Bitmap Indexing for Data Warehouses
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Performance Measurements of Compressed Bitmap Indices
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Optimizing Queries on Compressed Bitmaps
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Compressing Bitmap Indexes for Faster Search Operations
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
Bitmap Indices for Speeding Up High-Dimensional Data Analysis
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Query processing and optimization in Oracle Rdb
The VLDB Journal — The International Journal on Very Large Data Bases
Multidimensional Indexing and Query Coordination for Tertiary Storage Management
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Using bitmap index for interactive exploration of large datasets
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Supporting RFID-based item tracking applications in Oracle DBMS using a bitmap datatype
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimizing candidate check costs for bitmap indices
Proceedings of the 14th ACM international conference on Information and knowledge management
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Approximate encoding for direct access and query processing over compressed bitmaps
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Detecting distributed scans using high-performance query-driven visualization
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Multi-resolution bitmap indexes for scientific data
ACM Transactions on Database Systems (TODS)
Variable Interactions in Query-Driven Visualization
IEEE Transactions on Visualization and Computer Graphics
A novel approach to revealing positive and negative co-regulated genes
Journal of Computer Science and Technology
RLH: bitmap compression technique based on run-length and huffman encoding
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Analytic use of bitmap indices
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
Capturing semantics from bitmap indices for data analysis
SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
High performance multivariate visual data exploration for extremely large data
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Breaking the Curse of Cardinality on Bitmap Indexes
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Real-time GPS via Jamdroid server enhanced by TelegraphCQ & augmented by RFID tag
Proceedings of the International Conference on Advances in Computing, Communication and Control
Information processing using data stream management system on Jamdroid
Proceedings of the International Conference on Advances in Computing, Communication and Control
RLH: Bitmap compression technique based on run-length and Huffman encoding
Information Systems
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data Parallel Bin-Based Indexing for Answering Queries on Multi-core Architectures
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Finding Regions of Interest in Large Scientific Datasets
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Data reduction for data analysis
ECC'08 Proceedings of the 2nd conference on European computing conference
Bitmap indexes for relational XML twig query processing
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient joins with compressed bitmap indexes
Proceedings of the 18th ACM conference on Information and knowledge management
Inverted indexes vs. bitmap indexes in decision support systems
Proceedings of the 18th ACM conference on Information and knowledge management
Sorting improves word-aligned bitmap indexes
Data & Knowledge Engineering
Analyses of multi-level and multi-component compressed bitmap indexes
ACM Transactions on Database Systems (TODS)
Visual cube and on-line analytical processing of images
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Time-HOBI: indexing dimension hierarchies by means of hierarchically organized bitmaps
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
GPU-WAH: applying GPUs to compressing bitmap indexes with word aligned hybrid
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Bitmap indexes for large scientific data sets: a case study
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
NET-FLi: on-the-fly compression, archiving and indexing of streaming network traffic
Proceedings of the VLDB Endowment
Efficient and scalable data evolution with column oriented databases
Proceedings of the 14th International Conference on Extending Database Technology
ISABELA-QA: query-driven analytics with ISABELA-compressed extreme-scale scientific data
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
pcapIndex: an index for network packet traces with legacy compatibility
ACM SIGCOMM Computer Communication Review
Optimizing i/o costs of multi-dimensional queries using bitmap indices
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Time-HOBI: Index for optimizing star queries
Information Systems
Foundations and Trends in Databases
Real-time creation of bitmap indexes on streaming network data
The VLDB Journal — The International Journal on Very Large Data Bases
Column imprints: a secondary index structure
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Scalable in situ scientific data encoding for analytical query processing
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
Accelerating gene context analysis using bitmaps
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitmap index can be very large. To overcome this size problem, specialized compression schemes are used. Even though there are empirical evidences that some of these compression schemes work well, there has not been any systematic analysis of their effectiveness. In this paper, we systematically analyze the two most efficient bitmap compression techniques, the Byte-aligned Bitmap Code (BBC) and the Word-Aligned Hybrid (WAH) code. Our analyses show that both compression schemes can be optimal. We propose a novel strategy to select the appropriate algorithms so that this optimality is achieved in practice. In addition, our analyses and tests show that the compressed indices are relatively small compared with commonly used indices such as B-trees. Given these facts, we conclude that bitmap index is efficient on attributes of low cardinalities as well as on those of high cardinalities.