Chaudhuri, Surajit ; Ganesan, Prasanna ; Sarawagi, Sunita (2003) Factorizing complex predicates in queries to exploit indexes In: 2003 ACM SIGMOD international conference on Management of data.
Full text not available from this repository.
Official URL: http://doi.org/10.1145/872757.872802
Related URL: http://dx.doi.org/10.1145/872757.872802
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to ACM, Inc |
| ID Code: | 128410 |
| Deposited On: | 20 Oct 2022 06:36 |
| Last Modified: | 14 Nov 2022 11:36 |
Repository Staff Only: item control page
