Detecting suspect answers in the presence of inconsistent information
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Repair-oriented relational schemas for multidimensional databases
Proceedings of the 15th International Conference on Extending Database Technology
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
Consistent query answering under spatial semantic constraints
Information Systems
Certain conjunctive query answering in SQL
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Tractable cases of clean query answering under entity resolution via matching dependencies
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Query rewriting using datalog for duplicate resolution
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Charting the tractability frontier of certain conjunctive query answering
Proceedings of the 32nd symposium on Principles of database systems
A multidimensional data model with subcategories for flexibly capturing summarizability
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Discovering denial constraints
Proceedings of the VLDB Endowment
Efficient querying of inconsistent databases with binary integer programming
Proceedings of the VLDB Endowment
The LLUNATIC data-cleaning framework
Proceedings of the VLDB Endowment
Tractable approximations of consistent query answering for robust ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Data repair of inconsistent DL-programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Integrity constraints are semantic conditions that a database should satisfy in order to be an appropriate model of external reality. In practice, and for many reasons, a database may not satisfy those integrity constraints, and for that reason it is said to be inconsistent. However, and most likely, a large portion of the database is still semantically correct, in a sense that has to be made precise. After having provided a formal characterization of consistent data in an inconsistent database, the natural problem emerges of extracting that semantically correct data, as query answers. The consistent data in an inconsistent database is usually characterized as the data that persists across all the database instances that are consistent and minimally differ from the inconsistent instance. Those are the so-called repairs of the database. In particular, the consistent answers to a query posed to the inconsistent database are those answers that can be simultaneously obtained from all the database repairs. As expected, the notion of repair requires an adequate notion of distance that allows for the comparison of databases with respect to how much they differ from the inconsistent instance. On this basis, the minimality condition on repairs can be properly formulated. In this monograph we present and discuss these fundamental concepts, different repair semantics, algorithms for computing consistent answers to queries, and also complexity-theoretic results related to the computation of repairs and doing consistent query answering. Table of Contents: Introduction / The Notions of Repair and Consistent Answer / Tractable CQA and Query Rewriting / Logically Specifying Repairs / Decision Problems in CQA: Complexity and Algorithms / Repairs and Data Cleaning