DPconv: Super-Polynomially Faster Join Ordering

arXiv - CS - Databases Pub Date : 2024-09-12 DOI:arxiv-2409.08013

Mihail Stoian, Andreas Kipf

引用次数: 0

Abstract

We revisit the join ordering problem in query optimization. The standard exact algorithm, DPccp, has a worst-case running time of $O(3^n)$. This is prohibitively expensive for large queries, which are not that uncommon anymore. We develop a new algorithmic framework based on subset convolution. DPconv achieves a super-polynomial speedup over DPccp, breaking the $O(3^n)$ time-barrier for the first time. We show that the instantiation of our framework for the $C_\max$ cost function is up to 30x faster than DPccp for large clique queries.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

DPconv：超快连接排序

我们重温了查询优化中的连接排序问题。标准精确算法 DPccp 的最坏运行时间为 $O(3^n)$。这对于大型查询来说昂贵得令人望而却步，而大型查询已不再罕见。我们开发了一种基于子集卷积的新算法框架。我们开发了基于子集卷积的新算法框架。与 DPccp 相比，DPconv 实现了超多项式提速，首次突破了 $O(3^n)$ 时间障碍。我们展示了我们的框架在$C_\max$成本函数上的实例化，在大型clique查询上比DPccp快了30倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

arXiv - CS - Databases

自引率

0.00%

发文量

期刊最新文献

Development of Data Evaluation Benchmark for Data Wrangling Recommendation System Messy Code Makes Managing ML Pipelines Difficult? Just Let LLMs Rewrite the Code! Fast and Adaptive Bulk Loading of Multidimensional Points Matrix Profile for Anomaly Detection on Multidimensional Time Series Extending predictive process monitoring for collaborative processes