The impact of load balancing to object-oriented query execution scheduling in parallel machine environment

  • Authors:

  • David Taniar;Clement H. C. Leung

  • Affiliations:

  • School of Business Systems, Monash University, P.O. Box 63B, Clayton, Vic. 3800, Australia;School of Communication and Informatics, Victoria University of Technology, P.O. Box 14428 MCMC, Melbourne 8001, Australia

  • Venue:
  • Information Sciences—Informatics and Computer Science: An International Journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Skewness has been one of the major problems not only in parallel relational database systems, but also in parallel object-oriented database systems. To improve performance of object-oriented query processing, a careful and intelligent skew handling for load balancing must be established. Depending on the parallel machine environment, whether it is a shared-memory or a shared-nothing architecture, load balancing can be achieved through "physical" or "logical" data re-distribution. It is not the aim of this paper to propose or to investigate skew handling methods, but rather to analyze the impact of load balancing to query execution scheduling strategies. Our analysis shows that when load balancing is achieved, "serial" execution scheduling is preferable to "parallel" execution scheduling strategy. In other words, allocating full resources to a sub-query seems to be better than dividing resources to multiple sub-queries.