Query Optimization for Selections using Bitmaps

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 28, Issue 2, 1999, Pages 227-238

  Wu, Ming Chuan ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345870317     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/304181.304202     Document Type: Article

References (20)

1. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers, 35(6), 1986.
2. R.E. Bryant, Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams, ACM Computing Surveys, 24(3), 1992.
3. C.-Y. Chan, Y.E. Ioannidis, Bitmap Index Design and Evaluation, SIGMOD Conf., Seattle, 1998.
4. C.-Y. Chan, Y.E. Ioannidis, Bitmap Index Design and Evaluation, CS Dept., Univ. of Wisconsin-Madison, http://www.cs.wisc.edu/~cychan/paper101.ps, 1997.
5. J.-H. Chu, G.D. Knott, An Analysis of B-Trees and Their Variants, Information Systems, 14(5), 1989.
6. D. Comer, The Ubiquitous B-Tree, ACM Computing Surveys, 11(2), June 1979.
7. D.J. DeWitt, R. Katz, F. Olken, L. Shapiro, M. Stonebraker, D. Wood, Implementation Techniques for Main Memory database Systems, SIGMOD, New York, 1984.
8. J. Feigenbaum, S. Kannan, M.Y. Vardi, M. Viswanathan, Complexity of Problems on Graphs Represented as OBDDs, AT&T Technical Report: 97.1.1, 1996.
9. G. Graefe, Query Evaluation Techniques for Large Databases, ACM Computing Surveys, 25(2), 1993.
10. K. Küspert, Storage Utilization in B*-Trees with a Generalized Overflow Technique, Acta Informatica, 19, 1983.
11. E.J. McCluskey, Minimisation of Boolean functions, Bell System Technical Journal, 35(6), 1956.
12. P. O'Neil, Model 204 Architecture and Performance, Springer-Verlag LNCS 359, 2nd Intl. Workshop on High Performance Transactions Systems, Asilomar, CA, 1987.
13. P. O'Neil, G. Graefe, Multi-Table Joins Through Bitmapped Join Indices, SIGMOD Record, 24(3), 1995.
14. P. O'Neil, D. Quass, Improved Query Performance with Variant Indexes, SIGMOD, Tucson, Arizona, May 1997.
15. W.V. Quine, The Problem of Simplifying Truth Functions, American Mathematical Monthly, 59(8), 1952.
16. S. Sarawagi, Indexing OLAP Data, Bulletin of the Technical Committee on Data Eng., Vol. 20, No. 1, Mar 1997.
17. L.D. Shapiro, Join Processing in Database Systems with Large Main Memories, ACM TODS, 11(3), 1986.
18. M.C. Wu, A. Buchmann, Encoded Bitmap Indexing for Data Warehouses, 14th ICDE, Orlando, 1998.
19. M.C. Wu, Query Optimization for Selections using Bitmaps, Tech. Report, DVS98-2, DVS1, CS Dept, Technische Universität Darmstadt, 1998.
20. K.L. Wu, P.S. Yu, Range-Based Bitmap Indexing for High Cardinality Attributes with Skew, Research Report, IBM Watson Research Center, May 1996.