@inproceedings {Bergmann-icmt09,
	title = {Efficient Model Transformations by Combining Pattern Matching Strategies},
	booktitle = {Theory and Practice of Model Transformations, Second International Conference, ICMT 2009, Zurich, Switzerland, June 29-30, 2009. Proceedings},
	series = {Lecture Notes in Computer Science},
	volume = {5563},
	year = {2009},
	note = {Acceptance rate: 22\%},
	pages = {20-34},
	publisher = {Springer},
	organization = {Springer},
	abstract = {<p>
	Recent advances in graph pattern matching techniques have demonstrated at various tool contests that graph transformation tools can scale up to handle very large models in model transformation problems. In case of local-search based techniques, pattern matching is driven by a search plan, which provides an optimal ordering for traversing and matching nodes and edges of a graph pattern. In case of incremental pattern matching, matches of a pattern are explicitly stored and incrementally maintained upon model manipulation, which frequently provides significant speed-up but with increased memory consumption. In the current paper, we present a hybrid pattern matching approach, which is able to combine local-search and incremental techniques on a per-pattern basis. Based upon experimental evaluation, we identify scenarios when such combination is highly beneficial, and provide guidelines for transformation designers for optimal selection of pattern matching strategy.</p>
},
	keywords = {Pattern matching, Viatra},
	url = {http://dx.doi.org/10.1007/978-3-642-02408-5_3},
	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 = {Richard F. Paige}
}
