Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2012: Graph Transformations pp 371–385Cite as

Applying Incremental Graph Transformation to Existing Models in Relational Databases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7562))

Abstract

As industrial practice demands larger and larger system models, the efficient execution of graph transformation remains an important challenge. Additionally, for real-world applications, compatibility and integration with already well-established technologies is highly desirable. Therefore, relational databases have been investigated before as off-the-shelf environments for graph transformation, since they are already widely used for storing, processing and querying large graphs.

The graph pattern matching phase of graph transformation typically dominates in cost due to its combinatorial complexity. Therefore significant attempts have been made to improve this process; incremental pattern matching is an approach that has been shown to exert favorable performance characteristics in many practical use cases. To this day, however, no solutions are available for applying incremental techniques side by side with already deployed systems built over relational databases.

In the current paper, we propose an approach that translates graph patterns and transformation rules into event-driven (trigger-based) SQL programs that seamlessly integrate with existing relational databases to perform incremental pattern matching. Additionally, we provide experimental evaluation of the performance of our approach.

This work was partially supported by SecureChange (ICT-FET-231101), CertiMoT (ERC_HU-09-01-2010-0003) and TÁMOP-4.2.1/B-09/1/KMR-2010-0002.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.): Handbook on Graph Grammars and Computing by Graph Transformation. Applications, Languages and Tools, vol. 2. World Scientific (1999)

    Google Scholar 

  2. Geiß, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A.: GrGen: A Fast SPO-Based Graph Rewriting Tool. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 383–397. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Zündorf, A.: Graph Pattern Matching in PROGRES. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 454–468. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Varró, G., Varró, D.: Graph transformation with incremental updates. In: Proc. GT-VMT 2004, International Workshop on Graph Transformation and Visual Modelling Techniques. ENTCS, vol. 109, pp. 71–83. Elsevier (2004)

    Google Scholar 

  5. Bergmann, G., Horváth, Á., Ráth, I., Varró, D.: A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 396–410. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Varró, G., Friedl, K., Varró, D.: Implementing a graph transformation engine in relational databases. Journal of Software and Systems Modelling 5(3), 313–341 (2006)

    Article  Google Scholar 

  7. Varró, G., Schürr, A., Varró, D.: Benchmarking for graph transformation. In: Proc. of the 2005 IEEE Symposium on Visual Languages and Human-Centric Computing, Dallas, Texas, USA, pp. 79–88 (September 2005)

    Google Scholar 

  8. Taentzer, G., Biermann, E., Bisztray, D., Bohnet, B., Boneva, I., Boronat, A., Geiger, L., Geiß, R., Horvath, Á., Kniemeyer, O., Mens, T., Ness, B., Plump, D., Vajk, T.: Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 514–539. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Schürr, A., Nagl, M., Zündorf, A. (eds.): AGTIVE 2007. LNCS, vol. 5088. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  10. Varró, D., Balogh, A.: The model transformation language of the VIATRA2 framework. Science of Computer Programming 68(3), 214–234 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Varró, D., Pataricza, A.: VPM: A visual, precise and multilevel metamodeling framework for describing mathematical domains and UML. Software and Systems Modeling 2(3), 187–210

    Google Scholar 

  12. Varró, G., Varró, D., Schürr, A.: Incremental Graph Pattern Matching: Data Structures and Initial Experiments. In: Graph and Model Transformation (GraMoT 2006). Electronic Communications of the EASST, vol. 4. EASST (2006)

    Google Scholar 

  13. Bergmann, G., Ökrös, A., Ráth, I., Varró, D., Varró, G.: Incremental pattern matching in the VIATRA transformation system. In: GRaMoT 2008, 30th International Conference on Software Engineering (2008)

    Google Scholar 

  14. Hearnden, D., Lawley, M., Raymond, K.: Incremental Model Transformation for the Evolution of Model-Driven Systems. In: Wang, J., Whittle, J., Harel, D., Reggio, G. (eds.) MoDELS 2006. LNCS, vol. 4199, pp. 321–335. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Ghamarian, A.H., Jalali, A., Rensink, A.: Incremental pattern matching in graph-based state space exploration. Electronic Communications of the EASST (2010) GraBaTs 2010, Enschede

    Google Scholar 

  16. Bergmann, G., Horváth, Á., Ráth, I., Varró, D.: Efficient Model Transformations by Combining Pattern Matching Strategies. In: Paige, R.F. (ed.) ICMT 2009. LNCS, vol. 5563, pp. 20–34. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Miranker, D.P., Lofaso, B.J.: The organization and performance of a TREAT-based production system compiler. IEEE Transactions on Knowledge and Data Engineering 3(1), 3–10 (1991)

    Article  Google Scholar 

  18. Batory, D.: The LEAPS algorithm. Technical Report CS-TR-94-28 (January 1994)

    Google Scholar 

  19. Forgy, C.L.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1), 17–37 (1982)

    Article  Google Scholar 

  20. Jin, C., Carbonell, J., Hayes, P.: ARGUS: Rete + DBMS = Efficient Persistent Profile Matching on Large-Volume Data Streams. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 142–151. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. In: Proc. Int. Conf. on Management of Data, pp. 157–166. ACM (1993)

    Google Scholar 

  22. Dong, G., Su, J., Topor, R.: First-order incremental evaluation of datalog queries. Annals of Mathematics and Artificial Intelligence, 282–296 (1993)

    Google Scholar 

  23. Varró, G., Horváth, Á., Varró, D.: Recursive Graph Pattern Matching: With Magic Sets and Global Search Plans. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 456–470. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Hoffmann, B., Jakumeit, E., Geiss, R.: Graph rewrite rules with structural recursion. In: Workshop on Graph Computation Models, Leicester, UK (2008)

    Google Scholar 

  25. Ullman, J.D., Garcia-Molina, H., Widom, J.: Database Systems: The Complete Book, 1st edn. Prentice Hall PTR, Upper Saddle River (2001)

    Google Scholar 

  26. Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 541–580 (April 1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Measurement and Information Systems, Budapest University of Technology and Economics, 1117, Budapest, Magyar tudósok krt. 2, Hungary

    Gábor Bergmann, Dóra Horváth & Ákos Horváth

Authors
  1. Gábor Bergmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dóra Horváth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ákos Horváth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  2. University of Paderborn, Zukunftsmeile 1, 33102, Paderborn, Germany

    Gregor Engels

  3. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  4. Leiden Center for Natural Computing, Leiden University, LCNC - LIACS, Niels Bohrweg 1, 2333 CA, Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergmann, G., Horváth, D., Horváth, Á. (2012). Applying Incremental Graph Transformation to Existing Models in Relational Databases. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Graph Transformations. ICGT 2012. Lecture Notes in Computer Science, vol 7562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33654-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33654-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33653-9

  • Online ISBN: 978-3-642-33654-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation