Conjunctive query evaluation by search-tree revisited
type: Item
instance of: scholarly article
title: Conjunctive query evaluation by search-tree revisited
zbMATH Open document ID: 1108.68037
author: Albert Atserias
published in: Theoretical Computer Science
publication date: 2007-03-12T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5132992
zbMATH Keywords: conjunctive query
zbMATH Keywords: constraint-satisfaction problem
zbMATH Keywords: treewidth
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.11.005
OpenAlex ID: W2147039299
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: The efficiency of resolution and Davis-Putnam procedures
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: On Interpolation and Automatization for Frege Systems
cites work: Conjunctive query containment revisited
cites work: Data exchange: getting to the core
cites work: The complexity of acyclic conjunctive queries
cites work: The core of a graph
cites work: Conjunctive-query containment and constraint satisfaction
cites work: On the complexity of database queries
DOI: 10.1016/J.TCS.2006.11.005
Recommended article: Database Theory - ICDT 2005
Recommended article: Conjunctive queries over trees
Recommended article: Conjunctive query containment over trees
Recommended article: Query evaluation via tree-decompositions
Recommended article: Q4473259
Recommended article: Optimizing Conjunctive Queries over Trees Using Schema Information
Recommended article: Conjunctive query containment over trees using schema information
Recommended article: Conjunctive query containment revisited
Recommended article: Counting and conjunctive queries in the lifted junction tree algorithm
description: scientific article; zbMATH DE number 5132992