2019•IJARCCEOpen access

SQL Query Optimization Techniques

Priyanka R. Munot, Dipali R. Patil, Kajal P. Pathak

Open full text 2 citations

Abstract

Query optimization is the overall process of choosing the most efficient means of executing a SQL statement.The optimizer attempts to generate the best execution plan for a SQL statement.The best execution plan is defined as the plan with the lowest cost among all considered candidate plans.SQL is a nonprocedural language, so the optimizer is free to merge, reorganize, and process in any order.The cost is a number that represents the estimated resource usage for an execution plan.The cost computation accounts for factors of query execution such as I/O, CPU, and communication.To implement query optimization methods such as Heuristic Greedy based optimization, Iterative Improvement based cost optimization and Ant Colony optimization algorithms.Show Comparison of cost, execution time and response time between Heuristic Greedy based optimization; Ant Colony Optimization and Iterative Improvement based cost optimization algorithms

Open-access reader

About this research paper

What this paper is about

Query optimization is the overall process of choosing the most efficient means of executing a SQL statement.The optimizer attempts to generate the best execution plan for a SQL statement.The best execution plan is defined as the plan with the lowest cost among all considered candidate plans.SQL is a nonprocedural language, so the optimizer is free to merge, reorganize, and process in any order.The cost is a number that represents the estimated resource usage for an execution plan.The cost computation accounts for factors of query execution such as I/O, CPU, and communication.To implement query optimization methods such as Heuristic Greedy based optimization, Iterative Improvement based cost optimization and Ant Colony optimization algorithms.Show Comparison of cost, execution time and response time between Heuristic Greedy based optimization; Ant Colony Optimization and Iterative Improvement based cost optimization algorithms

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Query optimization is the overall process of choosing the most efficient means of executing a SQL statement.The optimizer attempts to generate the best execution plan for a SQL statement.The best execution plan is defined as the plan with the lowest cost among all considered candidate plans.SQL is a nonprocedural language, so the optimizer is free to merge, reorganize, and process in any order.The cost is a number that represents the estimated resource usage for an execution plan.The cost computation accounts for factors of query execution such as I/O, CPU, and communication.To implement query optimization methods such as Heuristic Greedy based optimization, Iterative Improvement based cost optimization and Ant Colony optimization algorithms.Show Comparison of cost, execution time and response time between Heuristic Greedy based optimization; Ant Colony Optimization and Iterative Improvement based cost optimization algorithms

Key concepts: Query optimization, Computer science, SQL, Sargable, Query by Example, Programming language, Database, Information retrieval

Related papers

Back to paper searchBrowse research topicsOriginal source
SQL Query Optimization Techniques — Research Paper | ScholarLens