Tree balance and node allocation

  • Authors:
  • Yangjun Chen;Wolfgang Benn

  • Affiliations:
  • Department of Cornputer Science, Technical University of Chemnitz-Zwickau, Chemnitz, Germany;Department of Cornputer Science, Technical University of Chemnitz-Zwickau, Chemnitz, Germany

  • Venue:
  • IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, 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 [7] 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 conmuinication costs and load measurements. In addition, the queuing analysis has been utilized to estimate the response times of local database systems.