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.
Type de document :
Article dans une revue
Journal of the ACM (JACM), Association for Computing Machinery, 2010
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00537238
Contributeur : Pierre Senellart <>
Soumis le : vendredi 19 novembre 2010 - 19:06:04
Dernière modification le : samedi 3 mars 2018 - 15:12:04
Document(s) archivé(s) le : vendredi 26 octobre 2012 - 16:00:20

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00537238, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

102

Téléchargements de fichiers

511