Database Theory - ICDT 2005

DOI10.1007/B104421zbMATH Open1108.68442OpenAlexW4232873349MaRDI QIDQ5316615FDOQ5316615

Authors: Albert Atserias 

Publication date: 13 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104421

Recommendations

• Conjunctive query evaluation by search-tree revisited
• When is the evaluation of conjunctive queries tractable?
• Conjunctive-query containment and constraint satisfaction
• Semantic acyclicity for conjunctive queries: approximations and constraints
• The complexity of acyclic conjunctive queries

zbMATH Keywords

treewidthconjunctive queryconstraint-satisfaction problem

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (3)

• Conjunctive query evaluation by search-tree revisited
• Flexible Querying Using Criterion Trees: A Bipolar Approach
• An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries

This page was built for publication: Database Theory - ICDT 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316615)