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 (IKERBASQUE, Basque Foundation for Science; University of the Basque Country)
- 2. Moritz Müller (Kurt Gödel Research Center; University of Vienna)
BibTeX Citation
@inproceedings{chen_pods13,
address = {New York, NY, USA},
series = {{PODS} '13},
title = {{The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity}},
url = {https://dl.acm.org/doi/10.1145/2463664.2463669},
doi = {10.1145/2463664.2463669},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Chen, Hubie and Müller, Moritz},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,832 | Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory | 2019 | PODS | 5.093636e-05 |
| 11,834 | The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems | 2019 | PODS | 5.093636e-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 |
|---|---|---|---|---|
| 382 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00019546431 |
| 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018893507 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 2 | 4,393 | Bounded Conjunctive Queries | 2014 | VLDB |
| 3 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 4 | 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 5 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 6 | 4,266 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS |
| 7 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 8 | 8,673 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS |
| 9 | 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |
| 10 | 7,052 | The Parameterized Complexity of Database Queries | 2001 | PODS |