AI Chat AI Image Generator AI Video Text to Speech

Parallel Acyclic Joins with Canonical Edge Covers

01/11/2022

∙

by Yufei Tao, et al.

∙

∙

In PODS'21, Hu presented an algorithm in the massively parallel computation (MPC) model that processes any acyclic join with an asymptotically optimal load. In this paper, we present an alternative analysis of her algorithm. The novelty of our analysis is in the revelation of a new mathematical structure – which we name "canonical edge cover" – for acyclic hypergraphs. We prove non-trivial properties for canonical edge covers that offer us a graph-theoretic perspective about why Hu's algorithm works.

page 1

page 2

page 3

page 4

research

∙ 03/22/2019

Instance and Output Optimal Parallel Algorithms for Acyclic Joins

Massively parallel join algorithms have received much attention in recen...

0 Xiao Hu, et al. ∙

research

∙ 09/05/2017

Covers of Query Results

We introduce succinct lossless representations of query results called c...

0 Ahmet Kara, et al. ∙

research

∙ 11/30/2020

A Near-Optimal Parallel Algorithm for Joining Binary Relations

We present a constant-round algorithm in the massively parallel computat...

0 Bas Ketsman, et al. ∙

research

∙ 05/03/2022

Parameterized Vietoris-Rips Filtrations via Covers

A challenge in computational topology is to deal with large filtered geo...

0 Bradley J. Nelson, et al. ∙

research

∙ 07/12/2021

Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time

A minimum path cover (MPC) of a directed acyclic graph (DAG) G = (V,E) i...

0 Manuel Cáceres, et al. ∙

research

∙ 12/10/2022

Parallel Exploration of Directed Acyclic Graphs using the Actor Model

In this paper we describe a generic scheme for the parallel exploration ...

0 Rahul Prabhu, et al. ∙

research

∙ 07/13/2017

Parsing with Traces: An O(n^4) Algorithm and a Structural Representation

General treebank analyses are graph structured, but parsers are typicall...

0 Jonathan K. Kummerfeld, et al. ∙