The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Foundations of aggregation constraints
Theoretical Computer Science
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximation algorithms
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
Condensed Representation of Database Repairs for Consistent Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Census Data Repair: a Challenging Application of Disjunctive Logic Programming
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
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
Scalar aggregation in inconsistent databases
Theoretical Computer Science - Database theory
A cost-based model and effective heuristic for repairing constraints by value modification
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Constraint Databases
Consistent query answers on numerical databases under aggregate constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First-order query rewriting for inconsistent databases
ICDT'05 Proceedings of the 10th international conference on Database Theory
Consistent query answering in databases
ACM SIGMOD Record
Distance semantics for database repair
Annals of Mathematics and Artificial Intelligence
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
World-set decompositions: Expressiveness and efficient algorithms
Theoretical Computer Science
Preferred Database Repairs Under Aggregate Constraints
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
ACM Computing Surveys (CSUR)
Consistent query answers in the presence of universal constraints
Information Systems
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Repairing inconsistent XML write-access control policies
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Annotation based query answer over inconsistent database
Journal of Computer Science and Technology
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
ICDT'07 Proceedings of the 11th international conference on Database Theory
World-set decompositions: expressiveness and efficient algorithms
ICDT'07 Proceedings of the 11th international conference on Database Theory
DART: a data acquisition and repairing tool
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Project-Join-Repair: an approach to consistent query answering under functional dependencies
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole may fail to satisfy. Those answers are characterized as those that are invariant under minimal forms of restoring the consistency of the database. In this context, we study the problem of repairing databases by fixing integer numerical values at the attribute level with respect to denial and aggregation constraints. We introduce a quantitative definition of database fix, and investigate the complexity of several decision and optimization problems, including DFP, i.e. the existence of fixes within a given distance from the original instance, and CQA, i.e. deciding consistency of answers to aggregate conjunctive queries under different semantics. We provide sharp complexity bounds, identify relevant tractable cases; and introduce approximation algorithms for some of those that are intractable. More specifically, we obtain results like undecidability of existence of fixes for aggregation constraints; MAXSNP-hardness of DFP, but a good approximation algorithm for a relevant special case; and intractability but good approximation for CQA for aggregate queries for one database atom denials (plus built-ins).