Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Pichler, R., & Savenkov, V. (2010). Towards practical feasibility of core computation in data exchange. Theoretical Computer Science, 411(7–9), 935–957. https://doi.org/10.1016/j.tcs.2009.09.035
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
Journal:
Theoretical Computer Science
-
ISSN:
0304-3975
-
Date (published):
2010
-
Number of Pages:
23
-
Publisher:
ELSEVIER
-
Peer reviewed:
Yes
-
Keywords:
Theoretical Computer Science; General Computer Science
-
Abstract:
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.
