Name
Abstract | ||
|---|---|---|
Graph rewriting-based model transformation is a well known technique with strong mathematical background to process domain specific models represented as graphs. The performance optimization techniques realized in today's graph transformation engines usually place focus on the optimization of a single execution of the individual rules, and do not consider the optimization possibilities in the repeated execution. In this paper we present a performance optimization technique called deep exhaustive matching for exhaustively executed rules. Deep exhaustive matching continues the matching of the same rule from the next possible position after a successful rewriting phase, thus we can achieve noticeable performance gain. |
Year | Venue | Keywords |
|---|---|---|
2010 | ICSOFT 2010: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATA TECHNOLOGIES, VOL 2 | Model transformation, Graph rewriting, Model-driven engineering, Exhaustive matching |
Field | DocType | Citations |
Computer science,Theoretical computer science,Graph rewriting,Wait-for graph,Clique-width,Abstract semantic graph,Graph (abstract data type) | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamás Mészáros | 1 | 80 | 15.23 |
| Márk Asztalos | 2 | 108 | 10.94 |
| Gergely Mezei | 3 | 143 | 24.62 |
| Hassan Charaf | 4 | 211 | 31.15 |