Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
“One size fits all” database architectures do not work for DSS
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Database buffer size investigation for OLTP workloads
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
An efficient bitmap encoding scheme for selection queries
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Query optimization for selections using bitmaps
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
CubiST: a new algorithm for improving the performance of ad-hoc OLAP queries
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
A survey in indexing and searching XML documents
Journal of the American Society for Information Science and Technology - XML
Performance comparison of property map and bitmap indexing
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Strategies for processing ad hoc queries on large data warehouses
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Proceedings of the eleventh international conference on Information and knowledge management
BitCube: A Three-Dimensional Bitmap Indexing for XML Documents
Journal of Intelligent Information Systems
Performance Measurements of Compressed Bitmap Indices
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Hierarchical Prefix Cubes for Range-Sum Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Generalised Hash Teams for Join and Group-by
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
What can Hierarchies do for Data Warehouses?
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
A Data Warehousing Architecture for Enabling Service Provisioning Process
Proceedings of the 27th International Conference on Very Large Data Bases
Shared Index Scans for Data Warehouses
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Bitmap-Based Indexing for Multi-dimensional Multimedia XML Documents
ICADL '02 Proceedings of the 5th International Conference on Asian Digital Libraries: Digital Libraries: People, Knowledge, and Technology
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
Exploiting early sorting and early partitioning for decision support query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Handbook of massive data sets
On the content of materialized aggregate views
Journal of Computer and System Sciences - Special issue on PODS 2000
Improving OLAP Performance by Multidimensional Hierarchical Clustering
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Querying multidimensional data
Multidimensional databases
CubiST++: Evaluating Ad-Hoc CUBE Queries Using Statistics Trees
Distributed and Parallel Databases
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
A bitmap-based access control for restricted views of XML documents
Proceedings of the 2003 ACM workshop on XML security
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
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 bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
Presto Authorization: A Bitmap Indexing Scheme for High-Speed Access Control to XML Documents
IEEE Transactions on Knowledge and Data Engineering
An extendible multidimensional array system for MOLAP
Proceedings of the 2006 ACM symposium on Applied computing
Answering top-k queries with multi-dimensional selections: the ranking cube approach
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Approximate encoding for direct access and query processing over compressed bitmaps
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Heuristic design of property maps
DOLAP '06 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP
Detecting distributed scans using high-performance query-driven visualization
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Supporting mobile decision making with association rules and multi-layered caching
Decision Support Systems
Extending the data warehouse for service provisioning data
Data & Knowledge Engineering - Special issue: ER 2003
Processing partially specified queries over high-dimensional databases
Data & Knowledge Engineering
Optimal Synchronization Policies for Data Warehouses
INFORMS Journal on Computing
Multi-resolution bitmap indexes for scientific data
ACM Transactions on Database Systems (TODS)
Processing star queries on hierarchically-clustered fact tables
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Star join revisited: Performance internals for cluster architectures
Data & Knowledge Engineering
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
High-dimensional OLAP: a minimal cubing approach
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
History offset implementation scheme for large scale multidimensional data sets
Proceedings of the 2008 ACM symposium on Applied computing
Hyperion: high volume stream archival for retrospective querying
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
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
Hierarchical clustering for OLAP: the CUBE File approach
The VLDB Journal — The International Journal on Very Large Data Bases
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
Analysis of Basic Data Reordering Techniques
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
Model and procedure for performance and availability-wise parallel warehouses
Distributed and Parallel Databases
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
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
HOBI: Hierarchically Organized Bitmap Index for Indexing Dimensional Data
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
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)
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Proceedings of the 13th International Conference on Extending Database Technology
Index structures for data warehouses
Index structures for data warehouses
An improved OLAP join and aggregate algorithm based on dimension hierarchy
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Small subset queries and bloom filters using ternary associative memories, with applications
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Effective bitmap indexing for non-metric similarities
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Yet another algorithms for selecting bitmap join indexes
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
An overview of the HDF5 technology suite and its applications
Proceedings of the EDBT/ICDT 2011 Workshop on Array Databases
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Ad hoc star join query processing in cluster architectures
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
An extendible array based implementation of relational tables for multi dimensional databases
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
An efficient indexing technique for computing high dimensional data cubes
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Time-HOBI: Index for optimizing star queries
Information Systems
Efficient bitmap-based indexing of time-based interval sequences
Information Sciences: an International Journal
PBFilter: A flash-based indexing scheme for embedded systems
Information Systems
Minimizing index size by reordering rows and columns
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Efficient content-based indexing of sequential data with bitmaps
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Space-efficient structures for detecting port scans
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Immune algorithm for bitmap join indexes
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
"Padding" bitmaps to support similarity and mining
Information Systems Frontiers
Normalised LCS-based method for indexing multidimensional data cube
International Journal of Intelligent Information and Database Systems
Bloofi: a hierarchical Bloom filter index with applications to distributed data provenance
Proceedings of the 2nd International Workshop on Cloud Intelligence
Re-Ordered FEGC and Block Based FEGC for Inverted File Compression
International Journal of Information Retrieval Research
Polygon-Based Query Evaluation over Geospatial Data Using Distributed Hash Tables
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
Intelligent Decision Technologies
Hi-index | 0.00 |
Bitmap indexing has been touted as a promising approach for processing complex adhoc queries in read-mostly environments, like those of decision support systems. Nevertheless, only few possible bitmap schemes have been proposed in the past and very little is known about the space-time tradeoff that they offer. In this paper, we present a general framework to study the design space of bitmap indexes for selection queries and examine the disk-space and time characteristics that the various alternative index choices offer. In particular, we draw a parallel between bitmap indexing and number representation in different number systems, and define a space of two orthogonal dimensions that captures a wide array of bitmap indexes, both old and new. Within that space, we identify (analytically or experimentally) the following interesting points: (1) the time-optimal bitmap index; (2) the space-optimal bitmap index; (3) the bitmap index with the optimal space-time tradeoff (knee); and (4) the time-optimal bitmap index under a given disk-space constraint. Finally, we examine the impact of bitmap compression and bitmap buffering on the space-time tradeoffs among those indexes. As part of this work, we also describe a bitmap-index-based evaluation algorithm for selection queries that represents an improvement over earlier proposals. We believe that this study offers a useful first set of guidelines for physical database design using bitmap indexes.