The Complexity of Conjunctive Queries with Degree 2
Summary: Introduce hypergraph dilutions and an Excluded-Grid analogue for degree-2 hypergraphs, yielding a characterization of CQ and #CQ tractability by generalized hypertree width beyond bounded arity. Extend the core result to bounded degree and sketch paths toward a full bounded-degree classification. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 626 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018973823 |
| 5,077 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 5.7153846e-05 |
Previous
Page 1 / 1
Next