On the finite controllability of conjunctive query answering in databases under open-world assumption

DOI10.1016/J.JCSS.2010.04.011MaRDI QIDQ532372zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Riccardo Rosati

Publication date 4 May 2011

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.2010.04.011

zbMATH Keywords

query answeringfinite controllabilityincomplete databasesintegrity constraintsopen-world assumption

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Controlled query evaluation with open queries for a decidable relational submodel
• Foundations of Information and Knowledge Systems
• scientific article; zbMATH DE number 1951561
• Reachability and connectivity queries in constraint databases
• Conjunctive-query containment and constraint satisfaction
• Conjunctive query containment revisited

Cites work

• scientific article; zbMATH DE number 1182735 (Why is no real title available?)
• scientific article; zbMATH DE number 1953133 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A Proof Procedure for Data Dependencies
• Answer sets for consistent query answering in inconsistent databases
• Answering queries using views: A survey
• Conjunctive query containment with respect to views and constraints
• Data exchange: getting to the core
• Deciding expressive description logics in the framework of resolution
• Formal Systems for Tuple and Equality Generating Dependencies
• How to prevent interaction of functional and inclusion dependencies
• Inclusion dependencies and their interaction with functional dependencies
• On XML integrity constraints in the presence of DTDs
• On conjunctive queries containing inequalities
• Polynomial-time implication problems for unary inclusion dependencies
• Recursive query plans for data integration
• Taming the infinite chase: query answering under expressive relational constraints
• Testing containment of conjunctive queries under functional and inclusion dependencies
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• The complexity of querying indefinite data about linearly ordered domains
• The implication problem for functional and inclusion dependencies

Cited in

(12)

• Certain answers over incomplete XML documents: extending tractability boundary
• On the data complexity of consistent query answering
• Finite Open-World Query Answering with Number Restrictions
• Tractable query answering and rewriting under description logic constraints
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
• Structural tractability of enumerating CSP solutions
• Guarded Ontology-Mediated Queries
• Finite open-world query answering with number restrictions
• Towards more expressive ontology languages: the query answering problem
• Containment of regular path queries under path constraints
• Conjunctive query containment and answering under description logic constraints
• Logical separability of labeled data examples under ontologies

This page was built for publication: On the finite controllability of conjunctive query answering in databases under open-world assumption

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