Query Evaluation via Tree-Decompositions

This publication has 15 references indexed in Scilit:

• The complexity of acyclic conjunctive queries
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Hypertree decompositions and tractable queries
  Published by Association for Computing Machinery (ACM) ,1999
• Conjunctive-query containment and constraint satisfaction
  Published by Association for Computing Machinery (ACM) ,1998
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
  SIAM Journal on Computing, 1996
• Conjunctive query containment revisited
  Published by Springer Nature ,1996
• Monadic second-order evaluations on tree-decomposable graphs
  Theoretical Computer Science, 1993
• Monotone monadic SNP and constraint satisfaction
  Published by Association for Computing Machinery (ACM) ,1993
• Easy problems for tree-decomposable graphs
  Journal of Algorithms, 1991
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
  SIAM Journal on Computing, 1984
• Generalized finite automata theory with an application to a decision problem of second-order logic
  Theory of Computing Systems, 1968