arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.0046cs.DB
收藏

多目标查询优化的近似方案

Approximation Schemes for Many-Objective Query Optimization

Immanuel Trummer, Christoph Koch

摘要:

多目标查询优化(MOQO)的目标是找到在云场景中实现冲突目标(例如最小化执行时间和最小化货币费用)之间的良好折衷的查询计划。以前提出的穷举MOQO算法需要几个小时来优化即使是简单的TPC-H查询。这就是为什么我们为MOQO提出了几个近似方案,这些方案可以在几秒钟内生成有保证的接近最优的计划,而穷举优化需要几个小时。我们将所有MOQO算法集成到Postgres优化器中,并给出了TPC-H查询的实验结果;我们扩展了Postgres成本模型,并在实验中优化了多达9个相互冲突的目标。所提出的算法是基于MOQO的背景下发生的典型成本函数的正式分析。我们确定的属性,持有广泛的目标,并可以利用未来的MOQO算法的设计。

英文摘要:

The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conflicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive MOQO algorithm needs hours to optimize even simple TPC-H queries. This is why we propose several approximation schemes for MOQO that generate guaranteed near-optimal plans in seconds where exhaustive optimization takes hours. We integrated all MOQO algorithms into the Postgres optimizer and present experimental results for TPC-H queries; we extended the Postgres cost model and optimize for up to nine conflicting objectives in our experiments. The proposed algorithms are based on a formal analysis of typical cost functions that occur in the context of MOQO. We identify properties that hold for a broad range of objectives and can be exploited for the design of future MOQO algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑