| Available via | http://dbpubs.stanford.edu/pub/2003-56 |
|
Submitted on |
14th of August 2003 |
|
Author |
Chaudhuri, Surajit; Ganesan, Prasanna; Sarawagi, Sunita |
|
Title |
Factorizing Complex Predicates in Queries to Exploit Indexes |
|
Date of publication |
2003 |
|
Published in |
SIGMOD 2003 |
|
Citation |
Chaudhuri, Surajit; Ganesan, Prasanna; Sarawagi, Sunita. Factorizing Complex Predicates in Queries to Exploit Indexes, SIGMOD 2003 |
|
Number of pages |
12 |
|
Language |
English |
|
Project |
Miscellaneous |
|
Type |
Conference or Journal Paper |
|
Subject group |
Databases and the Web |
|
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. |
| Fulltext source |
Postscript (ps, ps.gz, ps.zip)
PDF (pdf, pdf.gz, pdf.zip)
| Management of the document by | siroker@db.stanford.edu
| |