Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
show main publications
@inproceedings{icgt08-bhrv,
author = {G{\\'a}bor Bergmann and
Akos Horv{\\'a}th and
Istv{\\'a}n R{\\'a}th and
D{\\'a}niel Varr{\\'o}},
title = {A Benchmark Evaluation of Incremental Pattern Matching in
Graph Transformation},
editor = {Hartmut Ehrig and
Reiko Heckel and
Grzegorz Rozenberg and
Gabriele Taentzer},
booktitle = {Proc. 4th International Conference on Graph Transformations, ICGT 2008},
location = {Leicester, United Kingdom, September 7-13, 2008},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {5214},
year = {2008},
pages = {396-410},
ee = {http://dx.doi.org/10.1007/978-3-540-87405-8_27},
keywords = {incremental graph pattern matching - RETE - benchmarking},
abstract = { In graph transformation, the most cost-intensive phase of a transformation
execution is pattern matching, where those subgraphs of a model graph are identified and
matched which satisfy constraints prescribed by graph patterns. Incremental pattern matching
aims to improve the efficiency of this critical step by storing the set of matches of a
graph transformation rule and incrementally maintaining it as the model changes, thus
eliminating the need of recalculating existing matches of a pattern. In this paper, we
propose benchmark examples where incremental pattern matching is expected to have
advantageous effect in the application domain of model simulation and model synchronization.
Moreover, we compare the incremental graph pattern matching approach of Viatra2 with
advanced non-incremental local-search based graph pattern matching approaches
(as available in Viatra2 and GrGen). }
}
|