Matrix computations (3rd ed.)
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 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
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
ACM Computing Surveys (CSUR)
A performance comparison of bitmap indexes
Proceedings of the tenth international conference on Information and knowledge management
Dynamic multidimensional histograms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
Compressing Bitmap Indexes for Faster Search Operations
SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
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
Multidimensional Indexing and Query Coordination for Tertiary Storage Management
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
C-store: a column-oriented DBMS
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)
Minimizing I/O Costs of Multi-Dimensional Queries with Bitmap Indices
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Bitmap Index Design Choices and Their Performance Implications
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
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
A spatial bitmap-based index for geographical data warehouses
Proceedings of the 2009 ACM symposium on Applied Computing
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
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Efficient bitmap-based indexing of time-based interval sequences
Information Sciences: an International Journal
Minimizing index size by reordering rows and columns
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Taming massive distributed datasets: data sampling using bitmap indices
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
SDQuery DSI: integrating data management support with a wide area data transfer protocol
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Hi-index | 0.00 |
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardinality, that is, their efficiency deteriorates as attribute cardinalities increase. A number of strategies have been proposed, but none of them addresses the problem adequately. In this paper, we propose a novel binned bitmap index that greatly reduces the cost to answer queries, and therefore breaks the curse of cardinality. The key idea is to augment the binned index with an Order-preserving Bin-based Clustering (OrBiC) structure. This data structure significantly reduces the I/O operations needed to resolve records that can not be resolved with the bitmaps. To further improve the proposed index structure, we also present a strategy to create single-valued bins for frequent values. This strategy reduces index sizes and improves query processing speed. Overall, the binned indexes with OrBiC great improves the query processing speed, and are 3 --- 25 times faster than the best available indexes for high-cardinality data.