Combined-semantics equivalence of conjunctive queries: decidability and tractability results

DOI10.1016/J.JCSS.2015.11.001zbMATH Open1333.68090DBLPjournals/jcss/Chirkova16OpenAlexW2236720847WikidataQ57432269 ScholiaQ57432269MaRDI QIDQ899579FDOQ899579

Rada Chirkova

Publication date: 30 December 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.11.001

Recommendations

• Semantic acyclicity for conjunctive queries: approximations and constraints
• scientific article; zbMATH DE number 3974350
• scientific article; zbMATH DE number 1951561
• Conjunctive-query containment and constraint satisfaction
• Parameterized complexity of completeness reasoning for conjunctive queries
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Semantic Optimization of Conjunctive Queries
• Determinacy and query rewriting for conjunctive queries and views

zbMATH Keywords

query containmentquery equivalencecombined semantics for query processing

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Query containment under bag and bag-set semantics
• Minimizing restricted-fanout queries
• Title not available (Why is that?)

Cited In (4)

• How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
• How hard is completeness reasoning for conjunctive queries?
• Deciding equivalences among conjunctive aggregate queries
• Title not available (Why is that?)

This page was built for publication: Combined-semantics equivalence of conjunctive queries: decidability and tractability results

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