PARQO:查询优化中的代价感知鲁棒计划选择
PARQO: Penalty-Aware Robust Plan Selection in Query Optimization
AI总结:
针对查询优化中选择性估计不确定性导致执行计划表现差的问题,提出PARQO系统,通过工作负载剖析建误差模型、敏感性分析找关键维度,能生成鲁棒高性能计划,实现高效参数化优化。
摘要:
查询优化器的有效性取决于选择性估计的准确性。由于这些估计存在不确定性,优化器生成的执行计划在实际应用中可能表现极差。本文提出PARQO(查询优化中的代价感知鲁棒计划选择)这一新型系统,用户可在其中定义强大的鲁棒性指标,用于评估在选择性估计不确定的情况下,某一计划相对于真实最优计划的预期代价。PARQO利用工作负载感知的剖析构建误差模型,并采用原则性的敏感性分析技术,识别对代价影响最大的、可人工解读的选择性维度。在三个基准测试上的实验表明,PARQO能够找到鲁棒且高性能的计划,并可实现高效有效的参数化优化。
英文摘要:
The effectiveness of a query optimizer relies on the accuracy of selectivity estimates. The execution plan generated by the optimizer can be extremely poor in reality due to uncertainty in these estimates. This paper presents PARQO (Penalty-Aware Robust Plan Selection in Query Optimization), a novel system where users can define powerful robustness metrics that assess the expected penalty of a plan with respect to true optimal plans under uncertain selectivity estimates. PARQO uses workload-informed profiling to build error models, and employs principled sensitivity analysis techniques to identify human-interpretable selectivity dimensions with the largest impact on penalty. Experiments on three benchmarks demonstrate that PARQO finds robust, performant plans, and enables efficient and effective parametric optimization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。