Topology Dependent Bounds For FAQs

by   Michael Langberg, et al.

In this paper, we prove topology dependent bounds on the number of rounds needed to compute Functional Aggregate Queries (FAQs) studied by Abo Khamis et al. [PODS 2016] in a synchronous distributed network under the model considered by Chattopadhyay et al. [FOCS 2014, SODA 2017]. Unlike the recent work on computing database queries in the Massively Parallel Computation model, in the model of Chattopadhyay et al., nodes can communicate only via private point-to-point channels and we are interested in bounds that work over an arbitrary communication topology. This is the first work to consider more practically motivated problems in this distributed model. For the sake of exposition, we focus on two special problems in this paper: Boolean Conjunctive Query (BCQ) and computing variable/factor marginals in Probabilistic Graphical Models (PGMs). We obtain tight bounds on the number of rounds needed to compute such queries as long as the underlying hypergraph of the query is O(1)-degenerate and has O(1)-arity. In particular, the O(1)-degeneracy condition covers most well-studied queries that are efficiently computable in the centralized computation model like queries with constant treewidth. These tight bounds depend on a new notion of `width' (namely internal-node-width) for Generalized Hypertree Decompositions (GHDs) of acyclic hypergraphs, which minimizes the number of internal nodes in a sub-class of GHDs. To the best of our knowledge, this width has not been studied explicitly in the theoretical database literature. Finally, we consider the problem of computing the product of a vector with a chain of matrices and prove tight bounds on its round complexity (over the finite field of two elements) using a novel min-entropy based argument.


page 1

page 2

page 3

page 4


Covers of Query Results

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

Algorithms for a Topology-aware Massively Parallel Computation Model

Most of the prior work in massively parallel data processing assumes hom...

Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries

We study the problem of estimating the number of edges in an n-vertex gr...

A tight bound for the clique query problem in two rounds

We consider a problem introduced by Feige, Gamarnik, Neeman, Rácz and Te...

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants

In a recent breakthrough result, Balliu et al. [FOCS'19] proved a determ...

Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting

The problem of consistent query answering for primary keys and self-join...

A Framework for Searching in Graphs in the Presence of Errors

We consider two types of searching models, where the goal is to design a...

Please sign up or login with your details

Forgot password? Click here to reset