@inproceedings {icgt08-bhrv,
	title = {A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation},
	booktitle = {Proc. 4th International Conference on Graph Transformations, ICGT 2008},
	series = {Lecture Notes in Computer Science},
	volume = {5214},
	year = {2008},
	note = {Acceptance rate: ~40\%},
	pages = {396-410},
	publisher = {Springer},
	organization = {Springer},
	abstract = {<p>
	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 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).</p>
},
	keywords = {incremental graph pattern matching - RETE - benchmarking, Viatra},
	author = {G{\'a}bor Bergmann and {\'A}kos Horv{\'a}th and Istv{\'a}n R{\'a}th and D{\'a}niel Varr{\'o}},
	editor = {Hartmut Ehrig and Reiko Heckel and Rozenberg, Grzegorz and Gabriele Taentzer}
}
