International Journal of Computer Applications & Information Technology
In distributed query processing, deciding to use joins or semi joins affects the cost of query processing a big way. In this paper, two existing algorithms namely Hill Climbing algorithm and SDD1 algorithm are used to demonstrate this. The comparative analysis of the query processing using joins and semi joins in distributed database query system is discussed. The total cost of the distributed query is calculated using communication costs as comparison criteria, experimental results have shown that applying semi join on intermediate relations of moderate size, reduces the overall cost of query as compared to cost computation using join approach.