Improving real world matching with decomposition process - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Improving real world matching with decomposition process

Sana Sellami
  • Fonction : Auteur
  • PersonId : 990530
Benharkat Aïcha-Nabila
Amghar Youssef

Résumé

Matching at large scale represents a laborious process. The standard approach trying to match the complete input schemas will often lead to performance problems matching. In this context, we propose a pre-matching approach based on a XML schemas reduction. The presented approach identifies common structures between and within XML schemas and attempts to scale down these input schemas. Our method uses tree mining techniques to identify these common structures. The interest of this approach is to reduce the size of the XML schemas before matching and to find, at the same time, the similarity of sub-parts of the schemas. As shown by our experiments, resulting schemas are much smaller than originals one which will improve matching performance.
Fichier non déposé

Dates et versions

hal-01381497 , version 1 (14-10-2016)

Identifiants

Citer

Sana Sellami, Benharkat Aïcha-Nabila, Amghar Youssef. Improving real world matching with decomposition process. 12th International Conference on Enterprise Information Systems (ICEIS 2010) , Jun 2010, Funchal, Madeira, Portugal. pp.151-158, ⟨10.5220/0002887001510158⟩. ⟨hal-01381497⟩
99 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More