In this paper, we propose a graph pattern matching framework that produces both a standalone compiled and an interpreter-based engine as a result of a uniform development process. This process uses the same pattern specification and shares all internal data structures, and nearly all internal modules. Additionally, runtime performance measurements have been carried out on both engines with exactly the same parameter settings to assess and reveal the overhead of our interpreter-based solution. © 2012 Springer-Verlag.
CITATION STYLE
Varró, G., Anjorin, A., & Schürr, A. (2012). Unification of compiled and interpreter-based pattern matching techniques. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7349 LNCS, pp. 368–383). https://doi.org/10.1007/978-3-642-31491-9_28
Mendeley helps you to discover research relevant for your work.