Analysis of Two Phase Query Optimization Algorithm for Generating Optimal Query Plan using Randomized Algorithm
9 Pages Posted: 20 Apr 2020
Date Written: April 18, 2020
Abstract
The environment in which large numbers of distributed sites are connected with each other, without sharing their physical memory is called distributed database system. The database systems that execute on each distributed sites are independent of each other. Replication and fragmentation are the two important techniques used in the development of distributed database. The replicas of the data are stored in different distributed sites for promoting the availability of data at all the distributed sites. Thus with the help of replication each distributed site can request for the replica of the data and can store the entire copy of the same. The concept of fragmentation is commonly used for flooding the data to various distributed sites. In this paper an attempts have been made to compare the results of Iterative Improvement (II), Simulated Annealing (SA) and 2 Phase Optimization (2PO) algorithms. The 2PO algorithm is also known as hybrid approach since it is a combination of II and SA. It is called 2 PO because it executes in two phase, in the first phase the II algorithm is applied, then in the second phase the SA algorithm is applied. The results of the experiments obtained after implementing II, SA and 2PO algorithms are compared. Based on the experimental result obtained it is oblivious that 2PO performs better than II and SA.
Keywords: Distributed database; Two Phase Optimization; Query Optimization
Suggested Citation: Suggested Citation