Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Data Mining and Knowledge Discovery
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Potter's Wheel: An Interactive Data Cleaning System
Proceedings of the 27th International Conference on Very Large Data Bases
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Data exchange: computing cores in polynomial time
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)
D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Declarative inconsistency handling in relational and semi-structured databases
Declarative inconsistency handling in relational and semi-structured databases
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
Consistent query answers in the presence of universal constraints
Information Systems
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
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Data correspondence, exchange and repair
Proceedings of the 13th International Conference on Database Theory
Disjunctive databases for representing repairs
Annals of Mathematics and Artificial Intelligence
Sampling the repairs of functional dependency violations under hard constraints
Proceedings of the VLDB Endowment
Update rewriting and integrity constraint maintenance in a schema evolution support system: PRISM++
Proceedings of the VLDB Endowment
Horizontal fragmentation for data outsourcing with formula-based confidentiality constraints
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
On the tractability and intractability of consistent conjunctive query answering
Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
Theoretical Computer Science
Inconsistency-tolerant integrity checking based on inconsistency metrics
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
Partial repairs that tolerate inconsistency
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Conflict-aware historical data fusion
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Data quality through model checking techniques
IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
A dichotomy in the complexity of consistent query answering for queries with two atoms
Information Processing Letters
On the data complexity of consistent query answering
Proceedings of the 15th International Conference on Database Theory
Bounded repairability for regular tree languages
Proceedings of the 15th International Conference on Database Theory
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
Repairing inconsistent dimensions in data warehouses
Data & Knowledge Engineering
Managing uncertainty in databases and scaling it up to concurrent transactions
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
Automating the database schema evolution process
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
Bounded repairability of word languages
Journal of Computer and System Sciences
Sampling from repairs of conditional functional dependency violations
The VLDB Journal — The International Journal on Very Large Data Bases
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 |
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framework of database repairs, which has been the topic of an extensive investigation over the past several years. Intuitively, a repair of an inconsistent database is a consistent database that differs from the given inconsistent database in a minimal way. So far, most of the work in this area has addressed the problem of obtaining the consistent answers to a query posed on an inconsistent database. Repair checking is the following decision problem: given two databases r and r', is r' a repair of r? Although repair checking is a fundamental algorithmic problem about inconsistent databases, it has not received as much attention as consistent query answering. In this paper, we give a polynomial-time algorithm for subset-repair checking under integrity constraints that are the union of a weakly acyclic set of local-as-view (LAV) tuple-generating dependencies and a set of equality-generating dependencies. This result significantly generalizes earlier work for subset-repair checking when the integrity constraints are the union of an acyclic set of inclusion dependencies and a set of functional dependencies. We also give a polynomial-time algorithm for symmetric-difference repair checking, when the integrity constraints form a weakly acyclic set of LAV tgds. After this, we establish a number of complexity-theoretic results that delineate the boundary between tractability and intractability for the repair-checking problem. Specifically, we show that the aforementioned tractability results are optimal; in particular, subset-repair checking for arbitrary weakly acyclic sets of tuple-generating dependencies is a coNP-complete problem. We also study cardinality-based repairs and show that cardinality-repair checking is coNP-complete for various classes of integrity constraints encountered in database design and data exchange.