Optimizing Query Performance using Hash and Sort Merge Join |
Author(s): |
| Siddhi Joshi , LJIET; Jignesh Vania, LJIET |
Keywords: |
| Hash merge join, Sort merge join, Relational database system |
Abstract |
|
This paper introduced a method for producing Hash Merge and Sort Merge Join with extending performance. Hash merge join is non-blocking join algorithm that deals with data items from remote sources via unpredictable, slow, and bursty network traffic. The HMJ algorithm designed with two goals: 1) Minimize the time to produce the first few results, and 2) Produce join results even if the two sources of the join operator occasionally get blocked. Sort Merge Join is conventional join algorithm in the database. It is used when large database is required for query optimizing. I implement hybrid version of both algorithm to increase performance of join. And compare this hybrid version with already implemented algorithm to check performance based on execution time. I conclude that hybrid gives better execution time than hash and sort merge join algorithm after completion of experiment study. |
Other Details |
|
Paper ID: IJSRDV3I40918 Published in: Volume : 3, Issue : 4 Publication Date: 01/07/2015 Page(s): 1568-1570 |
Article Preview |
|
|
|
|
