Skip to Main content Skip to Navigation
Journal articles

Schema Mapping Discovery from Data Instances

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.
Document type :
Journal articles
Complete list of metadata

https://hal-imt.archives-ouvertes.fr/hal-00567015
Contributor : Admin Télécom Paristech Connect in order to contact the contributor
Submitted on : Thursday, February 17, 2011 - 10:04:02 PM
Last modification on : Tuesday, April 26, 2022 - 2:07:44 PM

Links full text

Identifiers

Collections

Citation

Georg Gottlob, Pierre Senellart. Schema Mapping Discovery from Data Instances. Journal of the ACM (JACM), Association for Computing Machinery, 2010, 57 (2), pp.6. ⟨10.1145/1667053.1667055⟩. ⟨hal-00567015⟩

Share

Metrics

Record views

54