Worst-case optimal join algorithms are the class of join algorithms whose runtime match the
worst-case output size of a given join query. While the first provably worse-case optimal join …

We study the optimal communication cost for computing a full conjunctive query Q over p
distributed servers. Two prior results were known. First, for one-round algorithms over skew …

Due to the rapid development of massively parallel data processing systems such as
MapReduce and Spark, there have been revived interests in designing algorithms in a …

This paper considers the worst-case complexity of multi-round join evaluation in the
Massively Parallel Computation (MPC) model. Unlike the sequential RAM model, in which …

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 …

Massively parallel join algorithms have received much attention in recent years, while most
prior work has focused on worst-optimal algorithms. However, the worst-case optimality of …

Given a massive data graph G=(V, E) and a small pattern graph Q, the goal of subgraph
enumeration is to list all the subgraphs of G isomorphic to Q. In the external memory (EM) …

In this paper, we study the communication complexity for the problem of computing a
conjunctive query on a large database in a parallel setting with $ p $ servers. In contrast to …

of the ACM 2024 Volume 71, Number 2 Journal of the ACM continued on back cover INVITED
ARTICLES Logic and Computation Article 7 (70 pages) M. Lichter P. Schweitzer Choiceless …

A wide range of application areas require efficient algorithmic solutions for combinatorial
problems. The theory of NP-hardness tells us that we cannot expect optimal polynomial-time …