Topology Dependent Bounds For FAQs
Summary: Topology-aware round-complexity bounds for FAQs in the Chattopadhyay synchronous private-link model, focusing on Boolean conjunctive queries and PGM marginals. Tight bounds for O(1)-degenerate, O(1)-arity hypergraphs via a new GHD "internal-node-width", plus matrix-chain×vector lower bounds via a min-entropy argument. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Langberg (State University of New York at Buffalo)
- 2. Shi Li (State University of New York at Buffalo)
- 3. Sai Vikneshwar Mani Jayaraman (State University of New York at Buffalo)
- 4. Atri Rudra (State University of New York at Buffalo)
BibTeX Citation
@inproceedings{langberg_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{Topology Dependent Bounds For FAQs}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319686},
doi = {10.1145/3294052.3319686},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Langberg, Michael and Li, Shi and Jayaraman, Sai Vikneshwar Mani and Rudra, Atri},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,480 | Topology-aware Parallel Joins | 2024 | PODS | 4.9793485e-05 |
| 11,656 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.9793485e-05 |
| 11,941 | Algorithms for a Topology-aware Massively Parallel Computation Model | 2021 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020020639 |
| 798 | Query Processing for Sensor Networks | 2003 | CIDR | 0.00013915609 |
| 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.0001366708 |
| 849 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013504405 |
| 1,231 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.00011410373 |
| 1,481 | Skew in Parallel Query Processing | 2014 | PODS | 0.00010539119 |
| 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 8.0895728e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,056 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS |
| 2 | 9,183 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB |
| 3 | 9,890 | Sharing Aggregate Computation for Distributed Queries | 2007 | SIGMOD |
| 4 | 8,073 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS |
| 5 | 6,121 | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication | 2015 | PODS |
| 6 | 2,299 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS |
| 7 | 3,542 | Consensus Answers for Queries over Probabilistic Databases | 2009 | PODS |
| 8 | 11,656 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |
| 9 | 1,231 | Communication Steps for Parallel Query Processing | 2013 | PODS |
| 10 | 2,043 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS |