In this paper, we propose a new model-sensitive search plan generation algorithm to speed up the process of graph pattern matching. This dynamic programming based algorithm, which is able to handle general n-ary constraints in an integrated manner, collects statistical data from the underlying EMF model, and uses this information for optimization purposes. Additionally, runtime performance measurements have been carried out to quantitatively evaluate the effects of the search plan generation algorithm on the pattern matching engine. © 2012 Springer-Verlag.
CITATION STYLE
Varró, G., Deckwerth, F., Wieber, M., & Schürr, A. (2012). An algorithm for generating model-sensitive search plans for EMF models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7307 LNCS, pp. 224–239). https://doi.org/10.1007/978-3-642-30476-7_15
Mendeley helps you to discover research relevant for your work.