A Novel Approach to Optimize Subqueries for Open Source Databases

Abstract

Query Optimization is an important process in Relational databases. Here, we present an overview of the Query Optimization process, with a focus on providing insight of MySQL sub-queries to optimize Join Operation. Efficient join processing for sub queries is one of the most fundamental and well-studied tasks in database research. For a given query, there are many plans that can be considered, though the output will be the same, but amount of time required is a key consideration. In this work, we examined existing algorithms for the way the sub queries are joined over many relations and described a novel sorting based algorithm to process these queries optimally. The algorithm is implemented and the results are compared with current strategies of MySQL. The proposed sorting based algorithm outperforms current algorithms without applying DBMS’ advanced techniques like parallel processing, hashing etc.