The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity
Summary: Fine-grained parameterized-logspace classification of Boolean conjunctive query evaluation: in the bounded-treewidth regime query sets split into three distinct degrees under para-L reductions. Degrees are pinned down by bounded pathwidth and bounded tree depth, with logspace machine characterizations and complete problems for the two harder degrees, yielding a richer structural/complexity map. (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. Hubie Chen
- 2. Moritz Müller
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,642 | Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory | 2019 | PODS | 4.1905499e-05 |
| 11,644 | The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems | 2019 | PODS | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 432 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023349408 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,795 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS | 4.9197522e-05 |
| 4,545 | Bounded Conjunctive Queries | 2014 | VLDB | 6.0917464e-05 |
| 432 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023349408 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1905499e-05 |
| 3,374 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 7.1631303e-05 |
| 3,005 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 7.7315492e-05 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 8,650 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS | 4.4710131e-05 |
| 11,326 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS | 4.1905499e-05 |
| 6,238 | The Parameterized Complexity of Database Queries | 2001 | PODS | 5.1369162e-05 |