Optimizing Distributed Query Processing

摘要

Distributed Query Processing requires the transmission of data between computers in a distributed system. In view of this fact, we describe a method to minimize the response time and the transmission cost for the distributed query processing problem. We show that the distributed query processing problem can be transformed to a query graph and an optimal cost join program is that of finding a set of cuts to that graph. The algorithm dynamically searches for the global optimal solution on a minimum solution tree, which is a subset of the solution tree of the traditional branch-and-bound method. The optimality criteria are the equality of data transmission and minimum transmission cost.