DPconv:超多项式级更快的连接排序
DPconv: Super-Polynomially Faster Join Ordering
AI总结:
本研究针对查询优化中连接排序问题的传统DPccp算法时间复杂度高的痛点,提出基于子集卷积的DPconv框架,实现超多项式级加速,且在大型团查询上比DPccp最高快30倍。
摘要:
我们重新研究查询优化中的连接排序问题。标准精确算法DPccp的最坏情况运行时间为$O(3^n)$,这对如今已不罕见的大型查询来说成本高得难以承受。我们提出一种基于子集卷积的新算法框架DPconv,它相比DPccp实现了超多项式级加速,首次打破$O(3^n)$的时间壁垒。实验表明,针对$C_\text{max}$代价函数的框架实例,在处理大型团查询时速度比DPccp最高快30倍。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。