Abstract

This paper will give an overview, and understandable explanation with examples, of known techniques for pattern matching and solving the sub-graph homomorphism problem. For clarity reasons, the presented techniques do not include performance adaptation, but does list some possible extensions. It is intended as a guideline, even for novices, and provides an in-depth look at the workings behind various techniques for efficient pattern matching.

  Reading material

• Efficient model transformations for novices (including implementations links)
• presentation

  Implementation

  Zipfile:

• pattern_matching.zip

  Individual files:

• enum.py
• generator.py
• graph.py
• graphToDot.py
• main.py
• patternMatching.py
• planGraph.py
• searchGraph.py