Generative Matching Between Heterogeneous Meta-Model' Systems Based on Hybrid Heuristic

Generative Automatic Matching Approach

This notion of generative matching or generative automatic matching has never been used before in the literature; Indeed, most of the approaches that have dealt with the problem of heterogeneities of the meta-models dealt only with the matching part between the models or even the meta-models, without treating the generation component between the models conforming to these meta-models, which presents the strong point of our approach. In this section, we will present our new approach GAM that addresses the problem of increasing heterogeneity of solutions. The aim of this approach is to allow the automatic generation of a system based on the matching between the different meta-models constituting the system, this approach is compose of two phases:

• •

  The first step of our approach allows the linkage between completely heterogeneous meta-models, not just the linkage between Level 1 schemes or instances and models or even meta-models dealing with the same domains or representing different meta-models of the same version as is the case for traditional matching approaches, for example this approach encompasses the alignment between database meta-models (relational or big data), and meta-models representing schemas as XML meta-models and meta-models of different object-oriented languages like c # or java;

• •

  The second step of our approach is the treatment of a second essential component, namely automatic generation between models; Indeed, the result of the matching is exploited to generate models called target of a final system from source models and that based on the automatic matching found in the first step.

Figure 1 shows the overall architecture of our approach.

Figure 1.

Global architecture of the generative matching approach