Towards practical feasibility of core computation in data exchange

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.