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
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,911 | Topology-aware Parallel Joins | 2024 | PODS | 4.1945683e-05 |
| 11,132 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.1945683e-05 |
| 11,436 | Algorithms for a Topology-aware Massively Parallel Computation Model | 2021 | PODS | 4.1945683e-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 |
|---|---|---|---|---|
| 583 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00019717214 |
| 885 | Query Processing for Sensor Networks | 2003 | CIDR | 0.00015646925 |
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 1,259 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00012995821 |
| 1,328 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012565612 |
| 1,411 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.0001212565 |
| 2,212 | Skew in Parallel Query Processing | 2014 | PODS | 9.2771827e-05 |
Previous
Page 1 / 1
Next