loading...
Robust Placement of Mobile Relational Operators for Large Scale Distributed Query Optimization
Adelaide, Australia December 03-December 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2007.53Eighth International Conference on Pa ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Citation:
Belgin Ergenc, Franck Morvan, Abdelkader Hameurlain, "Robust Placement of Mobile Relational Operators for Large Scale Distributed Query Optimization," pdcat, pp.227-235, Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.