10.4230/LIPICS.FSTTCS.2011.25
Kolaitis, Phokion G.
Phokion G.
Kolaitis
Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk)
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Invited Talk
Schema mappings
database constraints
data exchange
data integration
universal solutions
homomorphism dualities
Chakraborty, Supratik
Supratik
Chakraborty
Kumar, Amit
Amit
Kumar
2011
2011-12-01
2011-12-01
2011-12-01
en
urn:nbn:de:0030-drops-33598
10.4230/LIPIcs.FSTTCS.2011
978-3-939897-34-7
1868-8969
10.4230/LIPIcs.FSTTCS.2011
LIPIcs, Volume 13, FSTTCS 2011
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
2013
13
6
25
25
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Chakraborty, Supratik
Supratik
Chakraborty
Kumar, Amit
Amit
Kumar
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2011
13
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 pages
223402 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
Schema mappings are high-level specifications that describe the relationship between two database schemas. Schema mappings are considered to be the essential building blocks in such critical data interoperability tasks as data exchange and data integration. For this reason, they have been the focus of extensive research investigations over the past several years. Since in real-life applications schema mappings can be quite complex, it is important to develop methods and tools for illustrating, explaining, and deriving schema mappings. A promising approach to this effect is to use “good” data examples that illustrate the schema mapping at hand.
In this talk, we present an overview of recent work on characterizing and deriving schema mappings via a finite set of data examples. We show that every LAV schema mapping (i.e., a schema mapping specified by a finite set of local-as-view tuple-generating dependencies) is uniquely characterized by a finite set of universal data examples with respect to the class of all LAV schema mappings. We also show that this type of result does not hold for arbitrary GAV schema mappings (i.e., schema mappings specified by a finite set of global-as-view tuple- generating dependencies). After this, we give a necessary and sufficient algorithmic condition for a GAV schema mapping to be uniquely characterizable by a finite set of universal examples with respect to the class of all GAV schema mappings. Along the way, we establish tight connections between unique characterizability of schema mappings and homomorphism dualities.
This is joint work with Bogdan Alexe (IBM Research - Almaden), Balder ten Cate (UC Santa Cruz), and Wang-Chiew Tan (UC Santa Cruz and IBM Research - Almaden) based on [1, 2, 3].
LIPIcs, Vol. 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), pages 25-25