Database Paper Browser

Back to papers

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)

Paper ID
1226
Venue
PODS
Year
2001
Pagerank
5.1417208e-05
Overall Rank
6,239 | 56.60%
DOI
-

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers