Metamodel Matching Based on Planar Graph Edit Distance

A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and requires the task of discovering semantic correspondences between elements. This task is called metamodel matching. Recently, semi-automatic matching has been proposed to...

Full description

Saved in:
Bibliographic Details
Published inTheory and Practice of Model Transformations pp. 245 - 259
Main Authors Voigt, Konrad, Heinze, Thomas
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2010
SeriesLecture Notes in Computer Science
Subjects
Edit Distance
Ontology Match
Planar Embedding
Planar Graph
Seed Match
Online AccessGet full text
ISBN9783642136870
3642136877
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-13688-7_17

Cover

More Information
Summary:A prerequisite for implementing a model transformation is a mapping between metamodel elements. A mapping consists of matches and requires the task of discovering semantic correspondences between elements. This task is called metamodel matching. Recently, semi-automatic matching has been proposed to support transformation development by mapping generation. However, current matching approaches utilize labels, types and similarity propagation approaches rather than graph isomorphism as structural matching. In constrast, we propose to apply an efficient approximate graph edit distance algorithm and present the necessary adjustments and extensions of the general algorithm as well as an optimization with ranked partial seed mappings. We evaluated the algorithm using 20 large-size mappings demonstrating effectively the improvements, especially regarding the correctness of matches found.
ISBN:9783642136870
3642136877
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-13688-7_17