Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation

Author:

Hu Xiao1,Tao Yufei2

Affiliation:

1. University of Waterloo, Canada

2. Chinese University of Hong Kong, China

Abstract

We study equi-join computation in the massively parallel computation (MPC) model. Currently, a main open question under this topic is whether it is possible to design an algorithm that can process any join with load \(O(N {\rm {polylog}} N / p^{1/\rho ^*}) \) — measured in the number of words communicated per machine — where N is the total number of tuples in the input relations, ρ * is the join’s fractional edge covering number, and p is the number of machines. We settle the question in the negative for the class of tuple-based algorithms (all the known MPC join algorithms fall in this class) by proving the existence of a join query with ρ * = 2 that requires a load of Ω ( N / p 1/3 ) to evaluate. Our lower bound provides solid evidence that the “AGM bound” alone is not sufficient for characterizing the hardness of join evaluation in MPC (a phenomenon that does not exist in RAM). The hard join instance identified in our argument is cyclic, which leaves the question of whether \(O(N {\rm {polylog}} N / p^{1/\rho ^*}) \) is still possible for acyclic joins. We answer this question in the affirmative by showing that any acyclic join can be evaluated with load \(O(N / p^{1/\rho ^*}) \) , which is asymptotically optimal (there are no polylogarithmic factors in our bound). The separation between cyclic and acyclic joins is yet another phenomenon that is absent in RAM. Our algorithm owes to the discovery of a new mathematical structure — we call “canonical edge cover” — of acyclic hypergraphs, which has numerous non-trivial properties and makes an elegant addition to database theory.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference35 articles.

1. Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley.

2. Foto  N. Afrati , Manas  R. Joglekar , Christopher Ré , Semih Salihoglu , and Jeffrey  D. Ullman . 2017 . GYM: A Multiround Distributed Join Algorithm . In Proceedings of International Conference on Database Theory (ICDT). 4:1–4:18 . Foto N. Afrati, Manas R. Joglekar, Christopher Ré, Semih Salihoglu, and Jeffrey D. Ullman. 2017. GYM: A Multiround Distributed Join Algorithm. In Proceedings of International Conference on Database Theory (ICDT). 4:1–4:18.

3. The input/output complexity of sorting and related problems

4. Kaleb Alway , Eric Blais , and Semih Salihoglu . 2021 . Box Covers and Domain Orderings for Beyond Worst-Case Join Processing . In Proceedings of International Conference on Database Theory (ICDT). 3:1–3:23 . Kaleb Alway, Eric Blais, and Semih Salihoglu. 2021. Box Covers and Domain Orderings for Beyond Worst-Case Join Processing. In Proceedings of International Conference on Database Theory (ICDT). 3:1–3:23.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3