When is the evaluation of conjunctive queries tractable ?
Abstract
The evaluation of conjunctive queries is hard both with respect to its combined complexity (NP-complete) and its pa-rameterized complexity (W[1]-complete). It becomes trac-table (PTIME for combined complexity, FPT for parame-terized complexity), when the underlying graphs of the con-junctive 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. A technical result of independent interest is that the colored grid homomorphism problem is NP-complete and, if param-eterized by the grid size, W[1]-complete.
Domains
Computation and Language [cs.CL]
Origin : Files produced by the author(s)
Loading...