Query Optimization by Quantifier Elimination-Reference-Cited by-同舟云学术

Query Optimization by Quantifier Elimination

Published:2024-05-10 Issue:2 Volume:2 Page:1-25
ISSN:2836-6573
Container-title:Proceedings of the ACM on Management of Data
language:en
Short-container-title:Proc. ACM Manag. Data

Author:

Koch Christoph¹^ORCID,Lindner Peter¹^ORCID

Affiliation:

1. École Polytechnique Fédérale de Lausanne, Lausanne, VD, Switzerland

Abstract

Query optimizers have a limited arsenal of techniques for optimizing nested queries. In this paper, we develop a new approach for query optimization based on quantifier elimination. Quantifier elimination is a well-established tool for proving the decidability of logical theories. Here, however, we show that it can be turned into an effective query optimization technique that may yield asymptotic improvements in query processing efficiency. In addition, the technique establishes a foundation for certain well-known but previously little-understood aggregation based techniques for optimizing nested queries.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3651607

Reference15 articles.

1. Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley, Reading, MA, USA.

2. Umeshwar Dayal. 1987. Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers. In VLDB '87: Proceedings of the 13th International Conference on Very Large Data Bases. Morgan Kaufmann, San Francisco, CA, USA, 197--208.

3. Herbert B. Enderton. 2001. A Mathematical Introduction to Logic second ed.). Elsevier, San Diego, CA, USA.

4. Optimization of nested SQL queries revisited

5. Wilfrid Hodges. 1993. Model Theory. Cambridge University Press, Cambridge, UK.