Tree balance and node allocation
Yangjun Chen, Wolfgang Benn · 2002
We consider the query evaluation problem in multidatabases and develop an algorithm for generating optimal plans for queries submitted to an integrated schema. We try to extend the basic transformation step used in the method proposed by (Du et al., 1994) and construct a dynamic time table to support a query optimization process. In this way, not only the join tree balance, but also the node allocation can be achieved according to both communication costs and load measurements. In addition, the queuing analysis has been utilized to estimate the response times of local database systems.