Tuning the SQL Query in order to Reduce Time Consumption
P. Srinivas Karthik, Thippa Reddy Gadekallu, E. Kaari Vanan, M. Tech
Abstract
P. Srinivas Karthik, Thippa Reddy Gadekallu, E. Kaari Vanan, M. Tech
Abstract
The optimizer examines parsed and normalized queries, and information about database objects. The input to the optimizer is a parsed SQL query and statistics about the tables, indexes, and columns named in the query. The output from the optimizer is a query plan. The query plan is compiled code that contains the ordered steps to carry out the query, including the access methods (table scan or index scan, type of join to use, join order, and so on) to access each table. Using statistics on tables and indexes, the optimizer predicts the cost of using alternative access methods to resolve a particular query. It finds the best query plan – the plan that is least the costly in terms of I/O [1].For many queries, there are many possible query plans. Adaptive Server selects the least costly plan, and compiles and executes it. The query process very faster and less cost per query. This query optimization gives the High performance of the system and less stress on the database when data transmission occurs and the efficient usage of database engine and lesser memory consumed.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The optimizer examines parsed and normalized queries, and information about database objects. The input to the optimizer is a parsed SQL query and statistics about the tables, indexes, and columns named in the query. The output from the optimizer is a query plan. The query plan is compiled code that contains the ordered steps to carry out the query, including the access methods (table scan or index scan, type of join to use, join order, and so on) to access each table. Using statistics on tables and indexes, the optimizer predicts the cost of using alternative access methods to resolve a particular query. It finds the best query plan – the plan that is least the costly in terms of I/O [1].For many queries, there are many possible query plans. Adaptive Server selects the least costly plan, and compiles and executes it. The query process very faster and less cost per query. This query optimization gives the High performance of the system and less stress on the database when data transmission occurs and the efficient usage of database engine and lesser memory consumed.
Key concepts: Query optimization, Computer science, Sargable, Query by Example, Query plan, Query expansion, Online aggregation, View