Chaudhuri, Surajit and Ganesan, Prasanna and Sarawagi, Sunita (2003) Factorizing Complex Predicates in Queries to Exploit Indexes. In: ACM International Conference on Management of Data (SIGMOD 2003), June 9-12, 2003, San Diego, California.
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Computer Science > Databases and the Web|
|Deposited By:||Import Account|
|Deposited On:||13 Aug 2003 17:00|
|Last Modified:||24 Dec 2008 08:57|
Repository Staff Only: item control page