Heuristic Based Query Optimization

Abstract: In this paper, we will enlist the process of SQL query optimization based on Heuristic approach. It is often found in the database industry that a lot of time is consumed in executing inefficient SQL queries. The problem here is that although the DBA knows that the queries red are inefficient, the large sections of people who are actually ring these queries are unable to write efficient queries. As a result, the performance of the entire system degrades because of the drastic fall in the system throughput i.e. the number of transactions performed per unit time is reduced. Typically, to overcome this problematic situation, most of the people frequently consult the DBA for writing efficient queries. This approach results in a lot of time loss. A better solution is using a Query Optimizer. A Query Optimizer will accept the inputted user query and automatically generate a equivalent but highly optimized query. This will save a lot of time and e ort. This in turn improves the system throughput and its overall performance. The Query Optimizer in this project is a Heuristic Optimizer. It basically tries to minimize the number of accesses by reducing the number of tuples and number of columns to be searched.

Keywords: Query Optimization, Heuristic Approach, tuples