The Parameterized Complexity of Database Queries
Summary: Introduces parameterized complexity to the DB theory community and frames query evaluation as parameterized decision problems. Shows that evaluation of first-order queries and conjunctive queries, when parameterized by query (formula) size, is parameterized-hard, highlighting inherent complexity barriers. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Martin Grohe (University of Illinois Chicago)
BibTeX Citation
@inproceedings{grohe_pods01,
address = {New York, NY, USA},
series = {{PODS} '01},
title = {{The Parameterized Complexity of Database Queries}},
url = {https://dl.acm.org/doi/10.1145/375551.375564},
doi = {10.1145/375551.375564},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Grohe, Martin},
year = {2001}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,699 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 9.975915e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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 |
| 1,673 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 0.00010040854 |
| 2,330 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.7447066e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,563 | Complexity Aspects of Various Semantics for Disjunctive Databases | 1993 | PODS |
| 2 | 2,110 | Theory of Database Queries (Extended Abstract) | 1988 | PODS |
| 3 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 4 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 5 | 8,673 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS |
| 6 | 763 | On the Complexity of Bounded-Variable Queries | 1995 | PODS |
| 7 | 4,266 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS |
| 8 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 9 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 10 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |