PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
Logic Programs for Querying Inconsistent Databases
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Scalar aggregation in inconsistent databases
Theoretical Computer Science - Database theory
A Logical Framework for Querying and Repairing Inconsistent Databases
IEEE Transactions on Knowledge and Data Engineering
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Computing consistent query answers using conflict hypergraphs
Proceedings of the thirteenth ACM international conference on Information and knowledge management
ConQuer: efficient management of inconsistent databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Preferred answer sets for ordered logic programs
Theory and Practice of Logic Programming
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
QAGen: generating query-aware test databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
On the consistent rewriting of conjunctive queries under primary key constraints
Information Systems
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Querying and repairing inconsistent numerical databases
ACM Transactions on Database Systems (TODS)
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
A remark on the complexity of consistent conjunctive query answering under primary key violations
Information Processing Letters
Consistent answers to boolean aggregate queries under aggregate constraints
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Range-consistent answers of aggregate queries under aggregate constraints
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
A dichotomy in the complexity of consistent query answering for queries with two atoms
Information Processing Letters
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
Database Repairing and Consistent Query Answering
Database Repairing and Consistent Query Answering
Hi-index | 0.00 |
An inconsistent database is a database that violates one or more integrity constraints. A typical approach for answering a query over an inconsistent database is to first clean the inconsistent database by transforming it to a consistent one and then apply the query to the consistent database. An alternative and more principled approach, known as consistent query answering, derives the answers to a query over an inconsistent database without changing the database, but by taking into account all possible repairs of the database. In this paper, we study the problem of consistent query answering over inconsistent databases for the class for conjunctive queries under primary key constraints. We develop a system, called EQUIP, that represents a fundamental departure from existing approaches for computing the consistent answers to queries in this class. At the heart of EQUIP is a technique, based on Binary Integer Programming (BIP), that repeatedly searches for repairs to eliminate candidate consistent answers until no further such candidates can be eliminated. We establish rigorously the correctness of the algorithms behind EQUIP and carry out an extensive experimental investigation that validates the effectiveness of our approach. Specifically, EQUIP exhibits good and stable performance on conjunctive queries under primary key constraints, it significantly outperforms existing systems for computing the consistent answers of such queries in the case in which the consistent answers are not first-order rewritable, and it scales well.