The implication problem for functional and inclusion dependencies
Information and Control
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Notions of dependency satisfaction
Journal of the ACM (JACM) - The MIT Press scientific computation series
On the integrity of databases with incomplete information
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
The complexity of querying indefinite information: defined relations, recursion and linear order
The complexity of querying indefinite information: defined relations, recursion and linear order
Conjunctive query containment with respect to views and constraints
Information Processing Letters
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logical approaches to incomplete information: a survey
Logics for databases and information systems
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Static analysis in datalog extensions
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
The implication and finite implication problems for typed template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Implication and Referential Constraints: A New Formal Reasoning
IEEE Transactions on Knowledge and Data Engineering
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composing schema mappings: second-order dependencies to the rescue
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On reconciling data exchange, data integration, and peer data management
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Data-complexity of the two-variable fragment with counting quantifiers
Information and Computation
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Finite model reasoning in DL-lite
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Journal of Artificial Intelligence Research
Journal of Computer and System Sciences
The limits of querying ontologies
ICDT'07 Proceedings of the 11th international conference on Database Theory
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
An update on query answering with restricted forms of negation
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Access patterns and integrity constraints revisited
Proceedings of the 16th International Conference on Database Theory
Proceedings of the 32nd symposium on Principles of database systems
Capturing model-based ontology evolution at the instance level: The case of DL-Lite
Journal of Computer and System Sciences
Converging to the Chase -- A Tool for Finite Controllability
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
In this paper we study queries over relational databases with integrity constraints (ICs). The main problem we analyze is OWA query answering, i.e., query answering over a database with ICs under open-world assumption. The kinds of ICs that we consider are functional dependencies (in particular key dependencies) and inclusion dependencies; the query languages we consider are conjunctive queries (CQs), union of conjunctive queries (UCQs), CQs and UCQs with negation and/or inequality. We present a set of results about the decidability and finite controllability of OWA query answering under ICs. In particular: (i) we identify the decidability/undecidability frontier for OWA query answering under different combinations of the ICs allowed and the query language allowed; (ii) we study OWA query answering both over finite databases and over unrestricted databases, and identify the cases in which such a problem is finitely controllable, i.e., when OWA query answering over finite databases coincides with OWA query answering over unrestricted databases. Moreover, we are able to easily turn the above results into new results about implication of ICs and query containment under ICs, due to the deep relationship between OWA query answering and these two classical problems in database theory. In particular, we close two long-standing open problems in query containment, since we prove finite controllability of containment of conjunctive queries both under arbitrary inclusion dependencies and under key and foreign key dependencies. Besides their theoretical interest, we believe that the results of our investigation are very relevant in many research areas which have recently dealt with databases under an incomplete information assumption: e.g., view-based information access, ontology-based information systems, data integration, data exchange, and peer-to-peer information systems.