Towards Optimal Multi-Dimensional Query Processing with BitmapIndices

Rotem, Doron ; Stockinger, Kurt ; Wu, Kesheng

Lawrence Berkeley National Laboratory

关键词: Bitmap Index Binning Dynamic Programming;    Dimensions;    99 General And Miscellaneous//Mathematics, Computing, And Information Science;    Processing Bitmap Index Binning Dynamic Programming;    Algorithms;   

DOI  :  10.2172/881846
RP-ID  :  LBNL--58755
RP-ID  :  DE-AC02-05CH11231
RP-ID  :  881846

美国|英语

来源: UNT Digital Library

【 摘 要 】

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.