Towards Optimal Multi-Dimensional Query Processing with BitmapIndices
Bitmap indices have been widely used in scientific applications and commercial systems for processing complex, multi-dimensional queries where traditional tree-based indices would not work efficiently. This paper studies strategies for minimizing the access costs for processing multi-dimensional queries using bitmap indices with binning. Innovative features of our algorithm include (a) optimally placing the bin boundaries and (b) dynamically reordering the evaluation of the query terms. In addition, we derive several analytical results concerning optimal bin allocation for a probabilistic query model. Our experimental evaluation with real life data shows an average I/O cost improvement of at least a factor of 10 for multi-dimensional queries on datasets from two different applications. Our experiments also indicate that the speedup increases with the number of query dimensions.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director. Office of Science. Advanced ScientificComputing Research
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 881846
- Report Number(s):
- LBNL-58755; R&D Project: 429201; BnR: KJ0101030; TRN: US200613%%157
- Country of Publication:
- United States
- Language:
- English
Similar Records
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets usingFast Bitmap Indices
Multi-level Layout Optimization for Efficient Spatio-temporal Queries on ISABELA-compressed Data