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
- 1. Matthias Lanzinger (University of Oxford)
BibTeX Citation
@inproceedings{lanzinger_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{The Complexity of Conjunctive Queries with Degree 2}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524152},
doi = {10.1145/3517804.3524152},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lanzinger, Matthias},
year = {2022}
}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 |
|---|---|---|---|---|
| 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00015095061 |
| 5,461 | HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings | 2019 | PODS | 6.2090515e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,159 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS |
| 2 | 3,801 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |
| 3 | 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 4 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 5 | 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |
| 6 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 7 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 8 | 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 9 | 2,448 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS |
| 10 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |