Robust Placement of Mobile Relational Operators for Large Scale Distributed Query Optimization

  • Authors:
  • Belgin Ergenc;Franck Morvan;Abdelkader Hameurlain

  • Affiliations:
  • -;-;-

  • Venue:
  • PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a compile-time placement method of mobile relational operators MROs in a large scale environment. MROs are self adaptive to changing run- time conditions by deciding their execution place if they discover compile-time estimation errors. Proposed placement methods tend to have a main drawback with MROs running over a large scale environment: their focus is on finding optimal performance depending on single-point estimation at compile-time, instead of optimal performance over an estimation interval. We propose: (i) to determine the migration space of a MRO including the sites on which the MRO is allowed to migrate during its execution, and (ii) to find the robust site which will allow acceptable response time in an estimation interval. Performance study shows that, with a risk of loosing around 6% in response time, it is possible to gain up to 300% with the proposed robust placement.