Multi-table joins through bitmapped join indices
ACM SIGMOD Record
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
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
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Strategies for processing ad hoc queries on large data warehouses
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Optimizing Queries on Compressed Bitmaps
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Calculating Aggregates with Range-Encoded Bit-Sliced Index
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Supporting Group-By and Pipelining in Bitmap-Enabled Query Processors
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Bitmap Indices for Speeding Up High-Dimensional Data Analysis
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Schema Extraction for Multimedia XML Document Retrieval
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2
Querying multidimensional data
Multidimensional databases
Compressing Bitmap Indices by Data Reorganization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Supporting ranking and clustering as generalized order-by and group-by
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Multi-resolution bitmap indexes for scientific data
ACM Transactions on Database Systems (TODS)
On the performance of bitmap indices for high cardinality attributes
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Answering preference queries with bit-sliced index arithmetic
Proceedings of the 2008 C3S2E conference
Breaking the Curse of Cardinality on Bitmap Indexes
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes
Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
Secondary bitmap indexes with vertical and horizontal partitioning
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
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
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
Analyses of multi-level and multi-component compressed bitmap indexes
ACM Transactions on Database Systems (TODS)
Index structures for data warehouses
Index structures for data warehouses
Bitmap indexes for large scientific data sets: a case study
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Variable length compression for bitmap indices
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
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
Efficient bitmap-based indexing of time-based interval sequences
Information Sciences: an International Journal
Space-efficient structures for detecting port scans
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
On contextual ranking queries in databases
Information Systems
Column imprints: a secondary index structure
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
MILo-DB: a personal, secure and portable database machine
Distributed and Parallel Databases
Hi-index | 0.00 |
Bitmap indexes are useful in processing complex queries in decision support systems, and they have been implemented in several commercial database systems. A key design parameter for bitmap indexes is the encoding scheme, which determines the bits that are set to 1 in each bitmap in an index. While the relative performance of the two existing bitmap encoding schemes for simple selection queries of the form “v1 ≤ A ≤ v2” is known (specifically, one of the encoding schemes is better for processing equality queries; i.e., v1 = v2, while the other is better for processing range queries; i.e., v1 v2), it remains an open question whether these two encoding schemes are indeed optimal for their respective query classes in the sense that there is no other encoding scheme with better space-time tradeoff. In this paper, we establish a number of optimality results for the existing encoding schemes; in particular, we prove that neither of the two known schemes is optimal for the class of two-sided range queries. We also propose a new encoding scheme and prove that it is optimal for that class. Finally, we present an experimental study comparing the performance of the new encoding scheme with that of the existing ones as well as four hybrid encoding schemes for both simple selection queries and the more general class of membership queries of the form “A ∈ {v1, v2, .…, vk}”. These results demonstrate that the new encoding scheme has an overall better space-time performance than existing schemes.