arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.06295cs.DB
收藏

一种基于贝叶斯网络的查询选择性估计方法

An Approach Based on Bayesian Networks for Query Selectivity Estimation

Max Halford, Philippe Saint-Pierre, Frank Morvan

摘要:

查询执行计划的效率取决于成本模型提供给查询优化器的选择性估计的准确性。成本模型作出简化假设,以便及时作出上述估计。这些假设会导致选择性估计错误,从而对生成的查询执行计划的质量产生巨大影响。在当前成本模型中普遍存在的一个方便的假设是假设属性彼此独立。然而,它忽略了潜在的相关性,这可能对成本模型的准确性产生巨大的负面影响。在本文中,我们试图放松属性值的独立性假设,而不会不合理地恶化成本模型的准确性。我们提出了一种新的方法,基于一种特殊类型的贝叶斯网络称为Chow-Liu树近似的数据库中的每个关系的属性值的分布。我们在TPC-DS基准测试上的结果表明,我们的方法比其他方法精确一个数量级,同时在时间和空间方面保持合理的效率。

英文摘要:

The efficiency of a query execution plan depends on the accuracy of the selectivity estimates given to the query optimiser by the cost model. The cost model makes simplifying assumptions in order to produce said estimates in a timely manner. These assumptions lead to selectivity estimation errors that have dramatic effects on the quality of the resulting query execution plans. A convenient assumption that is ubiquitous among current cost models is to assume that attributes are independent with each other. However, it ignores potential correlations which can have a huge negative impact on the accuracy of the cost model. In this paper we attempt to relax the attribute value independence assumption without unreasonably deteriorating the accuracy of the cost model. We propose a novel approach based on a particular type of Bayesian networks called Chow-Liu trees to approximate the distribution of attribute values inside each relation of a database. Our results on the TPC-DS benchmark show that our method is an order of magnitude more precise than other approaches whilst remaining reasonably efficient in terms of time and space.

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

↑