A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Clio grows up: from research prototype to industrial tool
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Data exchange and incomplete information
Proceedings of the twenty-fifth 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
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient core computation in data exchange
Journal of the ACM (JACM)
Answering aggregate queries in data exchange
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 5.24 |
Data exchange is concerned with the transfer of data from some source database to some target database. Given a source instance, there may be many solutions, i.e., target instances. The most compact solution is called the core. Gottlob and Nash have recently presented a core computation algorithm which works in polynomial time under very general conditions. In this paper, we present an enhanced version of this algorithm. Moreover, we also report on a proof-of-concept implementation of the enhanced algorithm and on the experience gained from experiments with this implementation.