Query optimization for selections using bitmaps

Bitmaps are popular indexes for data warehouse (DW) applications and most database management systems offer them today. This paper proposes query optimization strategies for selections using bitmaps. Both continuous and discrete selection criteria are considered. Query optimization strategies are categorized into static and dynamic. Static optimization strategies discussed are the optimal design of bitmaps, and algorithms based on tree and logical reduction. The dynamic optimization discussed is the approach of inclusion and exclusion for both bit-sliced indexes and encoded bitmap indexes.

[1]  Goetz Graefe,et al.  Multi-table joins through bitmapped join indices , 1995, SGMD.

[2]  Don Batory,et al.  Query Processing in Database Systems , 2011, Topics in Information Systems.

[3]  Patrick E. O'Neil,et al.  Model 204 Architecture and Performance , 1987, HPTS.

[4]  Philip S. Yu,et al.  Range-based bitmap indexing for high cardinality attributes with skew , 1998, Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241).

[5]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[6]  Mahesh Viswanathan,et al.  The Complexity of Problems on Graphs Represented as OBDDs , 1998, Chic. J. Theor. Comput. Sci..

[7]  Sunita Sarawagi.  Indexing OLAP Data , 1997, IEEE Data Eng. Bull..

[8]  Alejandro P. Buchmann,et al.  Encoded bitmap indexing for data warehouses , 1998, Proceedings 14th International Conference on Data Engineering.

[9]  Jennifer Widom,et al.  Bulletin of the Technical Committee on , 1996 .

[10]  Patrick E. O'Neil,et al.  Improved query performance with variant indexes , 1997, SIGMOD '97.

[11]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.

[12]  Leonard D. Shapiro,et al.  Join processing in database systems with large main memories , 1986, TODS.

[13]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[14]  WuMing-Chuan.  Query optimization for selections using bitmaps , 1999 .

[15]  Yannis E. Ioannidis,et al.  Bitmap index design and evaluation , 1998, SIGMOD '98.

[16]  Yannis E. Ioannidis,et al.  Query optimization , 1996, CSUR.

[17]  GraefeGoetz.  Query evaluation techniques for large databases , 1993 .

[18]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[19]  Jiang-Hsing Chu,et al.  An Analysis of B-trees and their Variants , 1989, Inf. Syst..

[20]  Goetz Graefe,et al.  Query evaluation techniques for large databases , 1993, CSUR.

[21]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.