Computing Path Similarity Relevant to XML Schema Matching - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2008

Computing Path Similarity Relevant to XML Schema Matching

Amar Zerdazi
  • Fonction : Auteur
  • PersonId : 830285

Résumé

Similarity plays a crucial role in many research fields. Similarity serves as an organization principle by which individuals classify objects, form concepts. Similarity can be computed at different layers of abstraction: at data layer, at type layer or between the two layers (i.e. similarity between data and types). In this paper we propose an algorithm context path similarity, which captures the degree of similarity in the paths of two elements. In our approach, this similarity contributes to determine the structural similarity measure between XML schemas, in the domain of schema matching. We essentially focus on how to maximize the use of structural information to derive mappings between source and target XML schemas. For this, we adapt several existing algorithms in many fields, dynamic programming, data integration, and query answering to serve computing similarities..
Fichier principal
Vignette du fichier
zerdaziLamolle.pdf (76.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03580976 , version 1 (18-02-2022)

Identifiants

Citer

Amar Zerdazi, Myriam Lamolle. Computing Path Similarity Relevant to XML Schema Matching. On the Move to Meaningful Internet Systems: OTM 2008 Workshops, 5333, Springer Berlin Heidelberg, pp.66-75, 2008, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-88875-8_25⟩. ⟨hal-03580976⟩
4 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More