Skip to Main content Skip to Navigation

Une méthode d'optimisation hybride pour une évaluation robuste de requêtes

Abstract : The quality of an execution plan generated by a query optimizer is highly dependent on the quality of the estimates produced by the cost model. Unfortunately, these estimates are often imprecise. A body of work has been done to improve estimate accuracy. However, obtaining accurate estimates remains very challenging since it requires a prior and detailed knowledge of the data properties and run-time characteristics. Motivated by this issue, two main optimization approaches have been proposed. A first approach relies on single-point estimates to choose an optimal execution plan. At run-time, statistics are collected and compared with estimates. If an estimation error is detected, a re-optimization is triggered for the rest of the plan. At each invocation, the optimizer uses specific values for parameters required for cost calculations. Thus, this approach can induce several plan re-optimizations, resulting in poor performance. In order to avoid this, a second approach considers the possibility of estimation errors at the optimization time. This is modelled by the use of multi-point estimates for each error-prone parameter. The aim is to anticipate the reaction to a possible plan sub-optimality. Methods in this approach seek to generate robust plans, which are able to provide good performance for several run-time conditions. These methods often assume that it is possible to find a robust plan for all expected run-time conditions. This assumption remains unjustified. Moreover, the majority of these methods maintain without modifications an execution plan until the termination. This can lead to poor performance in case of robustness violation at run-time. Based on these findings, we propose in this thesis a hybrid optimization method that aims at two objectives : the production of robust execution plans, particularly when the uncertainty in the used estimates is high, and the correction of a robustness violation during execution. This method makes use of intervals of estimates around error-prone parameters. It produces execution plans that are likely to perform reasonably well over different run-time conditions, so called robust plans. Robust plans are then augmented with what we call check-decide operators. These operators collect statistics at run-time and check the robustness of the current plan. If the robustness is violated, check-decide operators are able to make decisions for plan modifications to correct the robustness violation without a need to recall the optimizer. The results of performance studies of our method indicate that it provides significant improvements in the robustness of query processing.
Document type :
Complete list of metadatas

Cited literature [83 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, June 22, 2018 - 9:39:05 AM
Last modification on : Sunday, August 16, 2020 - 3:31:08 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 7:21:16 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01820739, version 1



Chiraz Moumen. Une méthode d'optimisation hybride pour une évaluation robuste de requêtes. Arithmétique des ordinateurs. Université Paul Sabatier - Toulouse III, 2017. Français. ⟨NNT : 2017TOU30070⟩. ⟨tel-01820739⟩



Record views


Files downloads