Laconic Schema Mappings: Computing the Core with SQL Queries

Authors: 
Balder, TC; Chiticariu, L; Kolaitis, P; Wang-Chiew, T
Author: 
Balder, TC
Chiticariu, L
Kolaitis, P
Wang-Chiew, T
Year: 
2009
Venue: 
VLDB 2009
URL: 
http://dit.unitn.it/~p2p/RelatedWork/Matching/tenCate_vldb09.pdf
Citations: 
25
Citations range: 
10 - 49
AttachmentSize
Balder2009LaconicSchemaMappingsComputingtheCorewithSQLQueries.pdf234.28 KB

A schema mapping is a declarative specification of the relationship between instances of a source schema and a target schema. The data exchange (or data translation) problem asks: given an instance over the source schema, materialize an instance (or solution) over the target schema that satisfies the schema mapping. In general, a given source instance may have numerous different solutions. Among all the solutions, universal solutions and core universal solutions have been singled out and extensively studied. A universal solution is a most general one and also represents the entire space of solutions, while a core universal solution is the smallest universal solution and is unique up to isomorphism (hence, we can talk about the core).