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

Cited literature [31 references]  Display  Hide  Download
Contributor : Pierre Senellart Connect in order to contact the contributor
Submitted on : Friday, November 19, 2010 - 7:06:04 PM
Last modification on : Tuesday, September 8, 2020 - 4:58:02 PM
Long-term archiving on: : Friday, October 26, 2012 - 4:00:20 PM


Files produced by the author(s)


  • HAL Id : inria-00537238, version 1



Georg Gottlob, Pierre Senellart. Schema Mapping Discovery from Data Instances. Journal of the ACM (JACM), Association for Computing Machinery, 2010. ⟨inria-00537238⟩



Record views


Files downloads