A Study And Discussion Of Optimized Algorithm For Distributed Data Query

In recent years, along with the extensive application of the distribute system, the distribute database has become an important link within the information processing. The distribute data query is the core of the distribute database manages system, but the optimized query algorithm is the key technology in query the processed. The study of the distribute database manages system to begin from the 70's in 20 centuries middle, in the development of more than 30 years, obtained the plenteous result. The optimized algorithm of the distribute data query is also turn to more and more mature, but, because of the decentralization of the distribute data, have to make the distribute data query is more complex than the concentration data.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. The optimized query of the join operation has been hot point of people study and discuss all through. 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. When pay attention to the local processing price, usually adopt the optimized strategy of the direct-join, and make use of the data partition can achieve abreast deal with, raising the respond to time of query process.In this paper, through studied the traditional algorithm of grand old man, two kinds of new improvement algorithm about the join operation are proposed, it has the practical value in domain of complex query and largeness information query in the distribute database.