Title :
Tree balance and node allocation
Author :
Chen, Yangjun ; Benn, Wolfgang
Author_Institution :
Dept. of Comput. Sci., Tech. Univ. Chemnitz, Germany
Abstract :
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
Keywords :
database theory; distributed databases; optimisation; query processing; queueing theory; relational algebra; resource allocation; software performance evaluation; tree data structures; communication costs; dynamic time table; integrated schema; join tree balance; load measurement; local database systems; multidatabases; node allocation; optimal plans; query evaluation problem; query optimization; queuing analysis; response time estimation; transformation step; tree balance; Cost function; Database systems; Delay; Delta modulation; Linear programming; Multiprocessing systems; Query processing; Queueing analysis; Tree graphs;
Conference_Titel :
Database Engineering and Applications Symposium, 1997. IDEAS '97. Proceedings., International
Conference_Location :
Montreal, Que.
Print_ISBN :
0-8186-8114-4
DOI :
10.1109/IDEAS.1997.625660
