Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
Consistent query answering under inclusion dependencies
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Database repairing using updates
ACM Transactions on Database Systems (TODS)
The complexity of data exchange
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Consistent query answering in databases
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS)
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
CWA-solutions for data exchange settings with target dependencies
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Efficient core computation in data exchange
Journal of the ACM (JACM)
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Consistent query answers in the presence of universal constraints
Information Systems
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Data correspondence, exchange and repair
Proceedings of the 13th International Conference on Database Theory
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A remark on the complexity of consistent conjunctive query answering under primary key violations
Information Processing Letters
Journal of Computer and System Sciences
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
A dichotomy in the complexity of consistent query answering for queries with two atoms
Information Processing Letters
New measures for maintaining the quality of databases
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The framework of database repairs is a principled approach to managing inconsistency in databases. In particular, the consistent answers of a query on an inconsistent database provide sound semantics and the guarantee that the values obtained are those returned by the query on every repair of the given inconsistent database. In this paper, we carry out a systematic investigation of the data complexity of the consistent answers of conjunctive queries for set-based repairs and with respect to classes of constraints that, in recent years, have been extensively studied in the context of data exchange and data integration. Our results, which range from polynomial-time computability to undecidability, complement or improve on earlier work, and provide a fairly comprehensive picture of the data complexity of consistent query answering. We also address the problem of finding a "representative" or "useful" repair of an inconsistent database. To this effect, we introduce the notion of a universal repair, as well as relaxations of it, and then apply it to the investigation of the data complexity of consistent query answering.