A Study of Optimized Algorithm for Distributed Database Half-Join Query

摘要

In processing of the distribute data query, the join operation is the kind of the most in common use, time-consuming and a higher price, also is the key factor of the query efficiency for affect. While deal with the optimized of join operation, usually adopt the method of the half-join operation to cut the operand, reduce the transmit expense on the network, lowering the communications expenses. In this paper, through studied the traditional algorithm of grand old man, a new improvement algorithm about the half-join operation are proposed, it has the practical value in domain of complex query and largeness information query in the distribute database.