Topology Dependent Bounds For FAQs

@article{Langberg2019TopologyDB,
  title={Topology Dependent Bounds For FAQs},
  author={M. Langberg and Shi Li and Sai Vikneshwar Mani Jayaraman and A. Rudra},
  journal={Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems},
  year={2019}
}
  • M. Langberg, Shi Li, +1 author A. Rudra
  • Published 2019
  • Computer Science
  • Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
In this paper, we prove topology dependent bounds on the number of rounds needed to compute Functional Aggregate Queries ($\FAQ$s) 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… Expand
Algorithms for a Topology-aware Massively Parallel Computation Model
TLDR
This work focuses on network topologies that are tree topologies, and presents both lower bounds as well as (asymptotically) matching upper bounds, and takes the first step into investigating three fundamental data processing tasks in this topology-aware parallel model: set intersection, cartesian product, and sorting. Expand

References

SHOWING 1-10 OF 66 REFERENCES
Tight Network Topology Dependent Bounds on Rounds of Communication
TLDR
It is proved that tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness are found. Expand
A Tight Bound for Set Disjointness in the Message-Passing Model
TLDR
A tight lower bound of Ω(n · k) is proved for the set disjointness problem in the message passing model by developing information complexity tools for the message-passing model and proving an information complexity lower bound for set disJointness. Expand
Rectangles Are Nonnegative Juntas
TLDR
The main structure theorem states that each rectangle in the communication matrix of f o gn can be simulated by a nonnegative combination of juntas, the strongest yet formalization for the intuition that each low-communication randomized protocol can only "query" few inputs of f as encoded by the gadget g. Expand
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
TLDR
This paper proves lower bounds on randomized multiparty communication complexity, both in the blackboard model and in the message-passing model, and introduces a new technique for proving such bounds, called symmetrization, which is natural, intuitive, and often easy to use. Expand
Simulation beats richness: new data-structure lower bounds
TLDR
A new technique for proving lower bounds in the setting of asymmetric communication is developed and a deterministic lower- bound is obtained which is provably better than any lower-bound that may be obtained by the classical Richness Method. Expand
The Range of Topological Effects on Communication
TLDR
It is shown that for a large class of natural functions like Set-Disjointness the communication cost is essentially n times the cost of the optimal Steiner tree connecting the terminals, and for natural composed functions like Element-Distinctness ED and XOR the naive protocols suggested by their definition is optimal for general networks. Expand
Topology Matters in Communication
TLDR
A methodology for showing lower bounds that are sensitive to the graph topology is developed, and for a broad class of graphs a lower bound of the form Ω(k2n), for computing a function of k inputs, each of which is n-bits long and located at a different vertex is obtained. Expand
Worst-Case Optimal Algorithms for Parallel Query Processing
TLDR
This paper studies the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with $p$ servers, and shows a surprising connection to the external memory model, which allows us to translate parallel algorithms to external memory algorithms. Expand
Two applications of information complexity
We show the following new lower bounds in two concrete complexity models:<ol>(1) In the two-party communication complexity model, we show that the tribes function on n inputs[6] has two-sided errorExpand
GYM: A Multiround Distributed Join Algorithm
TLDR
A distributed and generalized version of Yannakakis's algorithm, called GYM, which takes as input any GHD of Q with width w and depth d, and computes Q in O(d + log(n) rounds and O(n (INw + OUT)2/M) communication cost. Expand
...
1
2
3
4
5
...