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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
