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
Query optimization for selections using bitmaps
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Designing and mining multi-terabyte astronomy archives: the Sloan Digital Sky Survey
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
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
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
Design and Implementation of Bitmap Indices for Scientific Data
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
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
Strategies for processing ad hoc queries on large data warehouses
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
Compressing Bitmap Indices by Data Reorganization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Approximate encoding for direct access and query processing over compressed bitmaps
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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
Divide-and-conquer scheme for strictly optimal retrieval of range queries
ACM Transactions on Storage (TOS)
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
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
| Hi-index | 0.00 |
Bitmap indices have gained wide acceptance in data warehouse applications and are an efficient access method for querying large amounts of read-only data. The main trend in bitmap index research focuses on typical business applications based on discrete attribute values. However, scientific data that is mostly characterised by nondiscrete attributes cannot be queried efficiently by currently supported access methods.In our previous work [13] we introduced a novel bitmap algorithm called GenericRangeEval for efficiently querying scientific data. We evaluated our approach based primarily on uniformly distributed and independent data. In this paper we analyse the behaviour of our bitmap index algorithm against various queries based on different data distributions.We have implemented an improved version of one of the most cited bitmap compression algorithms called Byte Aligned Bitmap Compression and adapted it to our bitmap indices. To prove the efficiency of our access method, we carried out high-dimensional queries against real data taken from two different scientific applications, namely High Energy Physics and Astronomy. The results clearly show that depending on the underlying data distribution and the query access patterns, our proposed bitmap indices can significantly improve the response time of high-dimensional queries when compared to conventional access methods.