A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching

With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern matching is performed as fast as possible. This challenge has been attacked by the approach of search plan driven, host-graph-sensitive (also known as model-sensitive) graph pattern matching. To our knowledge no experimental evaluation of this approach has been published yet. We performed first experiments regarding the runtime performance using the well-known GT benchmark introduced by Varro et al. as well as an example from compiler construction. Moreover we present an improved cost model and heuristics for search plans and their generation.

[1]  Gerhard Goos,et al.  Efficient Graph Rewriting and Its Implementation , 1995 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Reiko Heckel,et al.  Graph Transformation in a Nutshell , 2006, FoVMT.

[4]  Daniel Grund,et al.  GrGen: A Fast SPO-Based Graph Rewriting Tool , 2006, ICGT.

[5]  Jean Bézivin,et al.  Language Engineering for Model-driven Software Development , 2005 .

[6]  Gergely Varr ´ o,et al.  Generic Search Plans for Matching Advanced Graph Patterns , 2007 .

[7]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[8]  Rubino Geiß,et al.  GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool , 2007, AGTIVE.

[9]  Dániel Varró,et al.  Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans , 2006, GRaMoT@GPCE.

[10]  Dániel Varró,et al.  Benchmarking for graph transformation , 2005, 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05).

[11]  Gernot Veit Batz.  An Optimization Technique for Subgraph Matching Strategies , 2006 .

[12]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[13]  Albert Zündorf,et al.  Graph Pattern Matching in PROGRES , 1994, TAGT.

[14]  Ákos Horváth,et al.  Generic Search Plans for Matching Advanced Graph Patterns , 2007, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..