Towards a More Scalable Schema Matching: A Novel Approach

  • Authors:

  • Sana Sellami;Aïcha-Nabila Benharkat;Youssef Amghar

  • Affiliations:

  • LIRIS - National Institute of Applied Science of Lyon, France;LIRIS - National Institute of Applied Science of Lyon, France;LIRIS - National Institute of Applied Science of Lyon, France

  • Venue:
  • International Journal of Distributed Systems and Technologies
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 article, the authors are interested in studying scalable matching problem. The authors survey the approaches and tools of large scale matching, when a large number of schemas/ontologies and attributes are involved. They 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, they propose our scalable schema matching methodology that deals with the creation of a hybrid approach combining these techniques. Their architecture includes a pre-matching approach based on XML schemas decomposition. As shown by their experiments, their proposed methodology has been evaluated and implementing in a PLASMA Platform for LArge Scale MAtching prototype.