Free Join: Unifying Worst-Case Optimal and Traditional Joins
Free Join: Unifying Worst-Case Optimal and Traditional Joins
复制标题
自由连接:统一最坏情况的最优连接和传统连接
DOI:
10.1145/3589295
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
Suciu, Dan
中科院分区:
文献类型:
--
作者:
Wang, Yisu Remy;Willsey, Max;Suciu, Dan
Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new paradigm for one of the most fundamental challenges in query processing: computing joins efficiently. Such an algorithm can be asymptotically faster than traditional binary joins, all the while remaining simple to understand and implement. However, they have been found to be less efficient than the old paradigm, traditional binary join plans, on the typical acyclic queries found in practice. In an effort to unify and generalize the two paradigms, we proposed a new framework, called Free Join, in our SIGMOD 2023 paper. Not only does Free Join unite the worlds of traditional and worst-case optimal join algorithms, it uncovers optimizations and evaluation strategies that outperform both.In this article, we approach Free Join from the traditional perspective of binary joins, and re-derive the more general framework via a series of gradual transformations. We hope this perspective from the past can help practitioners better understand the Free Join framework, and find ways to incorporate some of the ideas into their own systems.
登录
查看更多内容
DOI:
--
发表时间:
2021
期刊:
GRADES-NDA@SIGMOD
影响因子:
--
作者:
Mark Raasveldt
通讯作者:
Mark Raasveldt
DOI:
--
发表时间:
2018
期刊:
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
影响因子:
--
作者:
H. Ngo
通讯作者:
H. Ngo
DOI:
10.1109/icde.2001.914871
发表时间:
2001
期刊:
Proceedings 17th International Conference on Data Engineering
影响因子:
--
作者:
S. Padmanabhan;Timothy Malkemus;R. Agarwal;A. Jhingran
通讯作者:
A. Jhingran
DOI:
--
发表时间:
2022
期刊:
CDMS@VLDB
影响因子:
--
作者:
Mark Raasveldt
通讯作者:
Mark Raasveldt
DOI:
10.14778/2002938.2002940
发表时间:
2011
期刊:
Proc. VLDB Endow.
影响因子:
--
作者:
T. Neumann
通讯作者:
T. Neumann