Surajit Chaudhuri
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.
- S. D. Bay. The UCI KDD archive {http://kdd.ics.uci.edu}. Irvine, CA: University of California, Department of Information and Computer Science, 1999.Google Scholar
- C. Blake and C. Merz. UCI repository of machine learning databases, 1998.Google Scholar
- R. K. Brayton. Factoring logic functions. IBM Journal of Research and Development, 31(2):187--198, 1987. Google ScholarDigital Library
- R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang. MIS: A multiple-level logic optimization system. IEEE Transactions on CAD/ICAS, CAD-6, 1987.Google ScholarDigital Library
- S. Chaudhuri and L. Gravano. Optimizing queries over multimedia repositories. In H. V. Jagadish and I. S. Mumick, editors, Proc. ACM SIGMOD 1996, Montreal, pages 91--102, 1996. Google ScholarDigital Library
- S. Chaudhuri, V. Narasayya, and S. Sarawagi. Efficient evaluation of queries with mining predicates. In Proc. of the 18th Int'l Conference on Data Engineering (ICDE), San Jose, USA, April 2002. Google ScholarDigital Library
- S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates (a shorter version appears in vldb 1996). TODS, 24(2):177--228, 1999. Google ScholarDigital Library
- S. Cluet and C. Delobel. A general framework for the optimization of object-oriented queries. In Proc. SIGMOD 1992, San Diego, California, pages 383--392, 1992. Google ScholarDigital Library
- U. Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In Proceedings of 13th International Conference on Very Large Data Bases, Brighton, England, pages 197--208, 1987. Google ScholarDigital Library
- G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73--170, Jun 1993. Google ScholarDigital Library
- M. Z. Hanani. An optimal evaluation of Boolean expressions in an online query system. CACM, 20(5):344--347, 1977. Google ScholarDigital Library
- J. M. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In SIGMOD Conference, pages 267--276, 1993. Google ScholarDigital Library
- A. Kemper, G. Moerkotte, K. Peithner, and M. Steinbrunn. Optimizing disjunctive queries with expensive predicates. In R. T. Snodgrass and M. Winslett, editors, Proc. SIGMOD 1994, Minneapolis, pages 336--347, 1994. Google ScholarDigital Library
- A. Kemper, G. Moerkotte, and M. Steinbrunn. Optimizing Boolean expressions in object-bases. In Proc. of the VLDB Conference, pages 79--90, Vancouver, Canada, August 1992. Google ScholarDigital Library
- H. Leslie, R. Jain, D. Birdsall, and H. Yaghmai. Efficient search of multi-dimensional "b"-trees. In VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, September 11--15, 1995, Zurich, Switzerland, pages 710--719. Morgan Kaufmann, 1995. Google Scholar
- M.C. Golumbic and A. Mintz. Factoring logic functions using graph partitioning. In Proc. IEEE/ACM Int'l. Conf. on Computer-Aided Design, (ICCAD-99), San Jose, CA, pages 195--198, 1999. Google ScholarDigital Library
- C. Mohan, D. Haderle, Y. Wang, and J. Cheng. Single table access using multiple indexes: optimization, execution, and concurrency control techniques. In Proc. International Conference on Extending Database Technology, pages 29--43, 1990. Google ScholarDigital Library
- M. Muralikrishna and D. J. DeWitt. Optimization of multiple-relation multiple-disjunct queries. In Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Austin, Texas, pages 263--275, 1988. Google ScholarDigital Library
- R. Brayton, G. Hachtel, and A.L. Sangiovanni-Vincentelli. Multilevel logic synthesis. Proceedings of the IEEE, 78:264--300, 1990.Google ScholarCross Ref
- L. T. Reinwald and R. M. Soland. Conversion of limited-entry decision tables to optimal computer programs: Minimum average processing time. JACM, 13(3):339--358, 1966. Google ScholarDigital Library
- P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proc. of the ACM SIGMOD International Conference on Management of Data, Boston, pages 23--34, 1979. Google ScholarDigital Library
- G. M. Wolfgang Scheufele. Efficient dynamic programming algorithms for ordering expensive joins and selections. In Proc. of the 6th Int'l Conference on Extending Database Technology (EDBT), Valencia, Spain, 1998. Google ScholarDigital Library
Index Terms
- Factorizing complex predicates in queries to exploit indexes
Recommendations
Hypergraph based reorderings of outer join queries with complex predicates
Complex queries containing outer joins are, for the most part, executed by commercial DBMS products in an "as written" manner. Only a very few reorderings of the operations are considered and the benefits of considering comprehensive reordering schemes ...
Generating reformulation trees for complex queries
SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrievalSearch queries have evolved beyond keyword queries. Many complex queries such as verbose queries, natural language question queries and document-based queries are widely used in a variety of applications. Processing these complex queries usually ...
Spatial queries with two kNN predicates
The widespread use of location-aware devices has led to countless location-based services in which a user query can be arbitrarily complex, i.e., one that embeds multiple spatial selection and join predicates. Amongst these predicates, the k-Nearest-...
Comments