Exploiting common subqueries for complex query optimization
Year: 2024
Type: conference-paper
Abstract: As database technology is applied to more and more application areas, user queries on a database become more and more complex. Existing query optimization techniques were not developed for dealing with complex queries and may suffer from some serious problem such as intolerably long optimization time and poor optimizing results. To tackle this challenge, we introduce a new technique to improve the quality of complex query optimization in this paper. The key idea is to exploit the common subqueries that often appear in a complex query and reuse the optimization work done for each common subquery. An algorithm to identify common subqueries efficiently and generate a high-quality execution plan for a given complex query is proposed. The complexity of the algorithm is analyzed. Experiments demonstrate that this proposed polynomial-time technique is quite promising in optimizing complex queries for a database management system.
DOI: 10.7302/24317
Authors: Tao, Yingying, Zhu, Qiang, Zuzarte, Calisto
Institutions: University of Michigan–Dearborn, IBM (Canada)
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1600758245