When is the evaluation of conjunctive queries tractable?

  title={When is the evaluation of conjunctive queries tractable?},
  author={Martin Grohe and Thomas Schwentick and Luc Segoufin},
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… CONTINUE READING
Highly Cited
This paper has 112 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 67 extracted citations

112 Citations

Citations per Year
Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-5 of 5 references

Graph minors V

  • N. Robertson, P. D. Seymour
  • Ex- cluding a planar graph. Journal of…
  • 1986
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…