A Flexible Approach for Planning Schema Matching Algorithms

Fabien Duchateau 1 Zohra Bellahsene 2 Remi Coletta 2
2 ZENITH - Scientific Data Management
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Most of the schema matching tools are assembled from multiple match algorithms, each employing a particular technique to improve matching accuracy and making matching systems extensible and customizable to a particular do- main. The solutions provided by current schema matching tools consist in aggre- gating the results obtained by several match algorithms to improve the quality of the discovered matches. However, aggregation entails several drawbacks. Re- cently, it has been pointed out that the main issue is how to select the most suitable match algorithms to execute for a given domain and how to adjust the multiple knobs (e.g. threshold, performance, quality, etc.). In this article, we present a novel method for selecting the most appropriate schema matching algorithms. The matching engine makes use of a decision tree to combine the most appro- priate match algorithms. As a first consequence of using the decision tree, the performance of the system is improved since the complexity is bounded by the height of the decision tree. Thus, only a subset of these match algorithms is used during the matching process. The second advantage is the improvement of the quality of matches. Indeed, for a given domain, only the most suitable match al- gorithms are used. The experiments show the effectiveness of our approach w.r.t. other matching tools.
Type de document :
Communication dans un congrès
CooPIS'08: Cooperative Information Systems, Nov 2008, Monterrey, Mexico, 1, pp.249-264, 2008, 〈http://www.cs.rmit.edu.au/fedconf/index.html?page=coopis2008cfp〉
Liste complète des métadonnées

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

Contributeur : Fabien Duchateau <>
Soumis le : lundi 6 octobre 2008 - 12:10:56
Dernière modification le : jeudi 11 janvier 2018 - 17:00:57
Document(s) archivé(s) le : lundi 8 octobre 2012 - 14:01:42


Fichiers produits par l'(les) auteur(s)


  • HAL Id : lirmm-00326885, version 1


Fabien Duchateau, Zohra Bellahsene, Remi Coletta. A Flexible Approach for Planning Schema Matching Algorithms. CooPIS'08: Cooperative Information Systems, Nov 2008, Monterrey, Mexico, 1, pp.249-264, 2008, 〈http://www.cs.rmit.edu.au/fedconf/index.html?page=coopis2008cfp〉. 〈lirmm-00326885〉



Consultations de la notice


Téléchargements de fichiers