Abstract
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 of a universal solution to a data exchange problem. Fagin, Kolaitis, and Popa [9], have shown that among 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 should be solution of choice. They stated as an important open problem whether of a universal solution can be computed in polynomial time in general setting where source-to-target constraints are arbitrary tuple generating dependencies (TGDs) and 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 of a universal solution. This positive result shows that approach of Fagin, Kolaitis, and Popa is feasible and applicable in a very general setting and thus provides a further momentum to use of cores in data exchange.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
