Answers are grounded in this paper and cite their sources.
The evaluation of conjunctive queries is hard both with respect to its combined complexity (NP-complete) and its parameterized complexity (W[1]-complete). It becomes tractable (PTIME for combined complexity, FPT for parameterized complexity), when the underlying graphs of the conjunctive queries have bounded tree-width [2]. We show that, in some sense, this is optimal both with respect to combined and parameterized complexity: For every class C of graphs, the evaluation of all conjunctive queries whose underlying graph is in C is tractable if, and only if, C has bounded tree-width.
No takes yet. Share an insight, caveat, or question.
Grohe et al. (2001) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: