A Rete Network Construction Algorithm for Incremental Pattern Matching

  • Gergely Varró
  • Frederik Deckwerth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7909)

Abstract

Incremental graph pattern matching by Rete networks can be used in many industrial, model-driven development and network analysis scenarios including rule-based model transformation, on-the-fly consistency validation, or motif recognition. The runtime performance of such an incremental pattern matcher depends on the topology of the Rete network, which is built at compile time. In this paper, we propose a new, dynamic programming based algorithm to produce a high quality network topology according to a customizable cost function and a user-defined quantitative optimization target. Additionally, the Rete network construction algorithm is evaluated by using runtime measurements.

Keywords

incremental graph pattern matching search plan generation algorithm Rete network construction 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jouault, F., Kurtev, I.: Transforming models with ATL. In: Bruel, J.-M. (ed.) MoDELS 2005. LNCS, vol. 3844, pp. 128–138. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    von Landesberger, T., Görner, M., Rehner, R., Schreck, T.: A system for interactive visual analysis of large graphs using motifs in graph editing and aggregation. In: Magnor, M.A., Rosenhahn, B., Theisel, H. (eds.) Proceedings of the Vision, Modeling, and Visualization Workshop, DNB, pp. 331–339 (2009)Google Scholar
  3. 3.
    Krumov, L., Schweizer, I., Bradler, D., Strufe, T.: Leveraging network motifs for the adaptation of structured peer-to-peer-networks. In: IEEE Proceedings of the Global Communications Conference, pp. 1–5 (2010)Google Scholar
  4. 4.
    Bunke, H., Glauser, T., Tran, T.-H.: An efficient implementation of graph grammar based on the RETE-matching algorithm. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 174–189. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  5. 5.
    Bergmann, G., Ökrös, A., Ráth, I., Varró, D., Varró, G.: Incremental pattern matching in the VIATRA model transformation system. In: Proc. of the 3rd Int. Workshop on Graph and Model Transformation, pp. 25–32. ACM (2008)Google Scholar
  6. 6.
    Ghamarian, A.H., Jalali, A., Rensink, A.: Incremental pattern matching in graph-based state space exploration. In: de Lara, J., Varró, D. (eds.) Proc. of the 4th International Workshop on Graph-Based Tools. ECEASST, vol. 32 (2010)Google Scholar
  7. 7.
    Forgy, C.L.: RETE: A fast algorithm for the many pattern/many object match problem. Artificial Intelligence 19, 17–37 (1982)CrossRefGoogle Scholar
  8. 8.
    Horváth, Á., Varró, G., Varró, D.: Generic search plans for matching advanced graph patterns. In: Workshop on Graph Transformation and Visual Modeling Techniques, vol. 6, ECEASST (2007)Google Scholar
  9. 9.
    Varró, G., Anjorin, A., Schürr, A.: Unification of compiled and interpreter-based pattern matching techniques. In: Vallecillo, A., Tolvanen, J.-P., Kindler, E., Störrle, H., Kolovos, D. (eds.) ECMFA 2012. LNCS, vol. 7349, pp. 368–383. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  10. 10.
    Varró, G., Deckwerth, F., Wieber, M., Schürr, A.: An algorithm for generating model-sensitive search plans for EMF models. In: Hu, Z., de Lara, J. (eds.) ICMT 2012. LNCS, vol. 7307, pp. 224–239. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  11. 11.
    Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16(9), 575–577 (1973)MATHCrossRefGoogle Scholar
  12. 12.
    Wong, E., Baur, B., Quader, S., Huang, C.-H.: Biological network motif detection: Principles and practice. Briefings in Bioinformatics 13(2), 202–215 (2012)CrossRefGoogle Scholar
  13. 13.
    Perlin, M.W.: Transforming conjunctive match into RETE: A call-graph caching approach. Technical Report 2054, Carnegie Mellon University (1991)Google Scholar
  14. 14.
    Tan, J.S.E., Srivastava, J., Shekhar, S.: On the construction of efficient match networks. Technical Report 91, University of Houston (1991)Google Scholar
  15. 15.
    Bergmann, G., Horváth, Á., Ráth, I., Varró, D., Balogh, A., Balogh, Z., Ökrös, A.: Incremental evaluation of model queries over EMF models. In: Petriu, D.C., Rouquette, N., Haugen, Ø. (eds.) MODELS 2010, Part I. LNCS, vol. 6394, pp. 76–90. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Gergely Varró
    • 1
  • Frederik Deckwerth
    • 1
  1. 1.Real-Time Systems LabTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations