Automatic Matching based on Graph Similarity

[tkowark]

The following needs to be done:

• fill the blanks, i.e., if we had A-r->B before, C-r2->D now, know that A=C and B=D, then r=r2
• detect property chaines, i.e., if we had A-r->B before and have C-r1->D-r2->E now, know that A=C (actually equivalent to) and B=E, then r = r1->D-r2->

[tkowark]

This is future work, I'd say. We could suggest correspondences and only have users confirm them, but what's the benefit? 1 click per Correspondence is not really worth the effort ...

With suggestions:

• Read the inferred correspondence
• Click Ok

Without suggestions:

• Click on the output element
• Click on Save Mapping