Schema Mapping Discovery from Data Instances - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of the ACM (JACM) Year : 2010

Schema Mapping Discovery from Data Instances

Pierre Senellart

Abstract

We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of data exchange. We formalize the problem of understanding the relationship between two instances as that of obtaining a schema mapping so that a minimum repair of this mapping provides a perfect description of the target instance given the source instance. We show that this definition yields “intuitive” results when applied on database instances derived from each other by basic operations. We study the complexity of decision problems related to this optimality notion in the context of different logical languages and show that, even in very restricted cases, the problem is of high complexity.
Fichier principal
Vignette du fichier
paper.pdf (425.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00537238 , version 1 (19-11-2010)

Identifiers

  • HAL Id : inria-00537238 , version 1

Cite

Georg Gottlob, Pierre Senellart. Schema Mapping Discovery from Data Instances. Journal of the ACM (JACM), 2010. ⟨inria-00537238⟩
85 View
400 Download

Share

Gmail Facebook X LinkedIn More