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
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,557 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 0.00011392493 |
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 |
|---|---|---|---|---|
| 407 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024004562 |
| 431 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023370207 |
| 2,015 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 9.7901938e-05 |
| 2,796 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1112658e-05 |
Previous
Page 1 / 1
Next