Name
Title | ||
|---|---|---|
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans |
Abstract | ||
|---|---|---|
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for pattern traversal (as an extension to traditional multiplicity and type considerations of existing tools) by estimating the expected performance of search plans on typical instance models that are available at transformation design time. Then, an adaptive approach for graph pattern matching is presented, where the optimal search plan can be selected from previously generated search plans at run-time based on statistical data collected from the current instance model under transformation. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.entcs.2005.10.025 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
search plans,search plans.,adaptive graph pattern matching,current instance model,model transformation tool,model-sensitive search plan generation,optimal search plan,pattern traversal,current paper,graph pattern,transformation design time,graph transformation,search plan,model-sensitive search plans,graph pattern matching,pattern matching,data collection | Graph pattern matching,Model transformation,Tree traversal,Computer science,Theoretical computer science,Graph rewriting,Transformation design,3-dimensional matching,Best-first search | Journal |
Volume | ISSN | Citations |
152, | Electronic Notes in Theoretical Computer Science | 46 |
PageRank | References | Authors |
3.00 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gergely Varró | 1 | 403 | 36.67 |
| Katalin Friedl | 2 | 173 | 14.18 |
| Dániel Varró | 3 | 1682 | 118.10 |