Towards a More Scalable Schema Matching - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Distributed Systems and Technologies Année : 2010

Towards a More Scalable Schema Matching

Aïcha-Nabila Benharkat
Youssef Amghar

Résumé

With the development and the use of a large variety.of. DB schemas and ontologies, in many domains (e.g. semantic web, digital libraries, life science, etc), matching techniques are called to overcome the challenge of aligning and reconciling these different interrelated representations. Matching field is becoming a very attractive research topic. In this paper, we are interested in studying scalable matching problem. We survey the approaches and tools of large scale matching, when a large number of schemas/ontologies and attributes are involved. We attempt to cover a variety of techniques for schema matching called Pair-wise and Holistic. One can acknowledge that this domain is on top of effervescence and scalable matching needs many more advances. Therefore, we propose our scalable schema matching methodology that deals with the creation of a hybrid approach combining these techniques. Our architecture includes a pre-matching approach based on XML schemas decomposition. As shown by our experiments, our proposed methodology has been evaluated and implementing in a PLASMA (Platform for Large Scale schema MAtching) prototype.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Sana Sellami, Aïcha-Nabila Benharkat, Youssef Amghar. Towards a More Scalable Schema Matching. International Journal of Distributed Systems and Technologies, 2010, 1, 1 (1), pp.17 - 39. ⟨10.4018/jdst.2010090802⟩. ⟨hal-01381430⟩
94 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More