{"docId":9436,"paperId":6944,"url":"https:\/\/lmcs.episciences.org\/6944","doi":"10.46298\/lmcs-18(2:6)2022","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":630,"name":"Volume 18, Issue 2"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"2011.14482","repositoryVersion":4,"repositoryLink":"https:\/\/arxiv.org\/abs\/2011.14482v4","dateSubmitted":"2020-12-01 08:22:20","dateAccepted":"2022-02-03 09:19:19","datePublished":"2022-05-05 00:00:00","titles":["A Near-Optimal Parallel Algorithm for Joining Binary Relations"],"authors":["Ketsman, Bas","Suciu, Dan","Tao, Yufei"],"abstracts":["We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm achieves a load of $\\tilde{O}(m\/p^{1\/\\rho})$ where $m$ is the total size of the input relations, $p$ is the number of machines, $\\rho$ is the join's fractional edge covering number, and $\\tilde{O}(.)$ hides a polylogarithmic factor. The load matches a known lower bound up to a polylogarithmic factor. At the core of the proposed algorithm is a new theorem (which we name the \"isolated cartesian product theorem\") that provides fresh insight into the problem's mathematical structure. Our result implies that the subgraph enumeration problem, where the goal is to report all the occurrences of a constant-sized subgraph pattern, can be settled optimally (up to a polylogarithmic factor) in the MPC model."],"keywords":["Computer Science - Databases"]}