Abstract

Query optimization is a challenging task for database management researchers. After parsing of queries during query processing, in query optimization step, various query execution plans are generated. The job of query optimizer is to propose an optimal plan that can evaluate the given relational expression at a reasonably lower cost. For every new input query instance, generating multiple execution plans and identifying an efficient optimal plan amongst is always challenging in terms of consumption of resources and costs associated with optimization. As the number of plans increases, it can take longer to find a good plan. Thus, to make query optimization practical and efficient, reusing the existing execution plans will provide the ideal solution for the new instances of equivalent old queries.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.