Tao, Yufei

English

In PODS'17, Ketsman and Suciu gave an algorithm in the MPC model for computing the result of any natural join where every input relation has two attributes. Achieving an optimal load O(m/p^{1/ρ}) - where m is the total size of the input relations, p the number of machines, and ρ the fractional edge covering number of the join - their algorithm requires 7 rounds to finish. This paper presents a simpler algorithm that ensures the same load with 3 rounds (in fact, the second round incurs only a load of O(p²) to transmit certain statistics to assist machine allocation in the last round). Our algorithm is made possible by a new theorem that provides fresh insight on the structure of the problem, and brings us closer to understanding the intrinsic reason why joins on binary relations can be settled with load O(m/p^{1/ρ})

DROPS Dagstuhl Research Online Publication Server

A Simple Parallel Algorithm for Natural Joins on Binary Relations

https://drops.dagstuhl.de/opus/volltexte/2020/11949/pdf/LIPIcs-ICDT-2020-25.pdf

A Simple Parallel Algorithm for Natural Joins on Binary Relations

Abstract

Similar works

Full text

Available Versions

DROPS Dagstuhl Research Online Publication Server