A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Removing redundancy from a clause
Artificial Intelligence
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Magic Sets and their application to data integration
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
On reconciling data exchange, data integration, and peer data management
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient core computation in data exchange
Journal of the ACM (JACM)
Data exchange in the presence of arithmetic comparisons
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The recovery of a schema mapping: bringing exchanged data back
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards a theory of schema-mapping optimization
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering aggregate queries in data exchange
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Assessing query privileges via safe and efficient permission composition
Proceedings of the 15th ACM conference on Computer and communications security
Towards Practical Feasibility of Core Computation in Data Exchange
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Schema exchange: Generic mappings for transforming data and metadata
Data & Knowledge Engineering
Logical foundations of relational data exchange
ACM SIGMOD Record
Generalized schema-mappings: from termination to tractability
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The recovery of a schema mapping: Bringing exchanged data back
ACM Transactions on Database Systems (TODS)
DEMo: data exchange modeling tool
Proceedings of the VLDB Endowment
Data correspondence, exchange and repair
Proceedings of the 13th International Conference on Database Theory
Foundations of Semantic Web databases
Journal of Computer and System Sciences
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Description logic knowledge base exchange
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
A sound and complete chase procedure for constrained tuple-generating dependencies
Journal of Intelligent Information Systems
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, namely, computing the core of a universal solution to a data exchange problem. Fagin, Kolaitis, and Popa [9], have shown that among the universal solutions of a solvable data exchange problem, there exists a most compact one (up to isomorphism), "the core" (of any universal solution), and have convincingly argued that this core should be the solution of choice. They stated as an important open problem whether the core of a universal solution can be computed in polynomial time in the general setting where the source-to-target constraints are arbitrary tuple generating dependencies (TGDs) and the target constraints consist of equation generating dependencies (EGDs) and weakly-acyclic TGDs. In this paper we solve this problem by developing new efficient methods for computing the core of a universal solution. This positive result shows that the core approach of Fagin, Kolaitis, and Popa is feasible and applicable in a very general setting and thus provides a further momentum to the use of cores in data exchange.