Metamodel matching techniques in MDA: challenge, issues and comparison

  • Authors:
  • Lamine Lafi;Slimane Hammoudi;Jamel Feki

  • Affiliations:
  • Institut Sup. des Sciences Appliquées et de Technologie, University of Sousse, Tunisia;Ecole Supérieure de l'Ouest Angers, France;Faculté des Sciences Economiques et de Gestion, University of Sfax, Tunisia

  • Venue:
  • MEDI'11 Proceedings of the First international conference on Model and data engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nowadays, it is well recognized that model transformation is at the heart of model driven engineering approaches (MDE) and represents as a consequence one of the most important operation in MDE. However, despite the multitude of model transformation language proposals emerging from university and industry, these transformations are often created manually, which is a fastidious and error-prone task, and therefore an expensive process. In this context, we argue that the semi-automatic generation of transformation rules is an important challenge in future MDE development to make it easier, faster, and cost-reduced process. In this paper we propose to discuss metamodels matching as a key technique for a semi-automatic transformation process. First, we review and discuss the main approaches that have been proposed in the state of the art for metamodels matching. Secondly, we compare three algorithms of metamodel matching namely "Similarity Flooding", SAMT4MDE+ and ModelCVS using match quality measures proposed for schema matching in databases. A Plug-in under the Eclipse framework has been developed to support our comparison using three couple of metamodels.