2003 Digital Symposium Collection

Factorizing Complex Predicates in Queries to Exploit Indexes

Surajit Chaudhuri, Prasanna Ganesan, and Sunita Sarawagi
View Paper (PDF)

Return to Query Processing

Abstract

Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting available indexes. We also present a novel idea of relaxing predicates in a complex condition to create possibilities for factoring. Our algorithms are designed for easy integration with existing query optimizers and support multiple optimization levels, providing different trade-offs between plan complexity and optimization time.

BIBTEX

@inproceedings       {DBLP:conf/sigmod/ChaudhuriGS03,
  author    = {Surajit Chaudhuri and
                Prasanna Ganesan and
                Sunita Sarawagi},
   booktitle = {SIGMOD Conference},
   title     = {Factorizing Complex Predicates in Queries to Exploit Indexes.},
   pages     = {361-372},
   year      = {2003},
   url       = {db/conf/sigmod/sigmod2003.html#ChaudhuriGS03},
   ee        = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r14p01.pdf},
   crossref  = {conf/sigmod/2003},
   bibsource = {DBLP, http://dblp.uni-trier.de}
}