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
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
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)
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Structural characterizations of schema-mapping languages
Proceedings of the 12th International Conference on Database Theory
Logical foundations of relational data exchange
ACM SIGMOD Record
Reverse data exchange: coping with nulls
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
On the data complexity of consistent query answering
Proceedings of the 15th International Conference on Database Theory
Representation systems for data exchange
Proceedings of the 15th International Conference on Database Theory
Hi-index | 0.00 |
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical perspective. In this paper we formally introduce the data correspondence setting and its associated computational problems: checking the existence of solutions, and verifying whether a candidate is a solution, for three distinct types of solutions. Data correspondence is a generalization of data exchange and peer data exchange, and a special case of repairing inconsistent databases. We introduce a new class of dependencies, called semi-LAV, that properly includes both LAV and full dependencies, while retaining tractability for peer data exchange, data correspondence, and database repairs. We also introduce the concept of Σ-satisfying homomorphisms. This new type of homomorphism, together with recent advances, is essential in achieving tractability, while at the same time allowing a large class of dependencies, namely the aforementioned semi-LAV ones. We also show the intractability for a series of problems in the case of weakly acyclic tuple generating dependencies. This implies that many tractability results for weakly acyclic dependencies do not carry over to data correspondence; in these new settings we need to restrict the dependencies a bit further, yielding our semi-LAV dependencies.