Factorizing complex predicates in queries to exploit indexes

  • Authors:
  • Surajit Chaudhuri;Prasanna Ganesan;Sunita Sarawagi

  • Affiliations:
  • Microsoft Research;Stanford University;IIT Bombay

  • Venue:
  • Proceedings of the 2003 ACM SIGMOD international conference on Management of data
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.