【24h】

Progressive Query Optimization for Federated Queries

机译:联合查询的渐进式查询优化

获取原文
获取原文并翻译 | 示例

摘要

Database Management Systems (DBMS) perform query plan selection by mathematically modeling the execution cost of candidate execution plans and choosing the cheapest query execution plan (QEP) according to that cost model. The cost model requires accurate estimates of the sizes of intermediate results of all steps in the QEP. Outdated or incomplete statistics, parameter markers and complex skewed data frequently cause the selection of a suboptimal query plan, which in turn results in bad query performance. Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the federated DBMS server. Their execution is typically divided between the federated server and the remote data sources. Outdated and incomplete statistics have a bigger impact on federated DBMS than on regular DBMS, as maintenance of federated statistics is unequally more complicated and expensive than the maintenance of the local statistics; consequently bad performance commonly occurs for federated queries due to the selection of a suboptimal query plan. We present an extension of the mid-query reoptimiza-tion technique "Progressive Query Optimization" (POP), which adds robustness to query processing by dynamically detecting if an access plan is suboptimal and by triggering a reoptimization in that case. Our extensions enable efficient reoptimization of federated queries. Our contributions are (a) an opportunistic, but risk controlled, reoptimization technique for federated DBMS (b) a technique for multiple reoptimizations during federated query processing, with a strategy to discover redundant and eliminate partial results and (c) a mechanism to eagerly procure statistics in a federated environment. We have implemented these techniques in a prototype version of WebSphere Information Integrator for DB2. Our enhancements enable robust and acceptable performance for federated queries, even if the remote data sources provided almost no statistical information about the data. An extensive case study on real world data shows POP has negligible runtime overhead and improves the performance of complex federated queries by up to a full order of magnitude.
机译:数据库管理系统(DBMS)通过对候选执行计划的执行成本进行数学建模并根据该成本模型选择最便宜的查询执行计划(QEP)来执行查询计划选择。成本模型要求准确评估QEP中所有步骤的中间结果的大小。统计信息过时或不完整,参数标记和复杂的偏斜数据经常导致选择次优查询计划,从而导致查询性能下降。联合查询是访问一个或多个远程关系或非关系数据源上的数据的常规关系查询,可能将它们与存储在联合DBMS服务器中的表进行组合。它们的执行通常在联合服务器和远程数据源之间分配。过时和不完整的统计信息对联邦DBMS的影响比对常规DBMS的影响要大,这是因为维护联邦统计信息比维护本地统计信息更为复杂和昂贵。因此,由于选择了次优的查询计划,联合查询的性能通常很差。我们提出了中间查询重新优化技术“渐进查询优化”(POP)的扩展,该技术通过动态检测访问计划是否欠佳并在这种情况下触发重新优化,为查询处理增加了鲁棒性。我们的扩展可以有效地优化联合查询。我们的贡献是(a)联合DBMS的机会主义但受风险控制的重新优化技术(b)联合查询处理期间的多次重新优化技术,以及发现冗余并消除部分结果的策略,以及(c)急于采购的机制联合环境中的统计信息。我们已经在WebSphere Information Integrator for DB2的原型版本中实现了这些技术。即使远程数据源几乎不提供有关数据的统计信息,我们的增强功能也可以为联合查询提供鲁棒且可接受的性能。大量有关现实世界数据的案例研究表明,POP的运行时开销可以忽略不计,并将复杂的联合查询的性能提高了一个完整的数量级。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号