Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Graph Pattern Matching in PROGRES
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans
Electronic Notes in Theoretical Computer Science (ENTCS)
MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS
GrGen: a fast SPO-based graph rewriting tool
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Unification of compiled and interpreter-based pattern matching techniques
ECMFA'12 Proceedings of the 8th European conference on Modelling Foundations and Applications
Hi-index | 0.00 |
In this paper, we propose a new model-sensitive search plan generation algorithm to speed up the process of graph pattern matching. This dynamic programming based algorithm, which is able to handle general n-ary constraints in an integrated manner, collects statistical data from the underlying EMF model, and uses this information for optimization purposes. Additionally, runtime performance measurements have been carried out to quantitatively evaluate the effects of the search plan generation algorithm on the pattern matching engine.