Conjunctive query evaluation by search-tree revisited

DOI10.1016/j.tcs.2006.11.005zbMath1108.68037OpenAlexW2147039299MaRDI QIDQ870265

Albert Atserias

Publication date: 12 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.005

zbMATH Keywords

treewidthconjunctive queryconstraint-satisfaction problem

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Generic expression hardness results for primitive positive formula comparison ⋮ On the expression complexity of equivalence and isomorphism of primitive positive formulas

Cites Work

• The core of a graph
• A partial k-arboretum of graphs with bounded treewidth
• On the complexity of database queries
• Conjunctive query containment revisited
• Conjunctive-query containment and constraint satisfaction
• The Efficiency of Resolution and Davis--Putnam Procedures
• The complexity of acyclic conjunctive queries
• Data exchange: getting to the core
• On Interpolation and Automatization for Frege Systems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Conjunctive query evaluation by search-tree revisited