Incremental pattern matching for the efficient computation of transitive closure

  • Authors:

  • Gábor Bergmann;István Ráth;Tamás Szabó;Paolo Torrini;Dániel Varró

  • Affiliations:

  • Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary;Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary;Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary;Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary;Department of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, Hungary

  • Venue:
  • ICGT'12 Proceedings of the 6th international conference on Graph Transformations
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pattern matching plays a central role in graph transformations as a key technology for computing local contexts in which transformation rules are to be applied. Incremental matching techniques offer a performance advantage over the search-based approach, in a number of scenarios including on-the-fly model synchronization, model simulation, view maintenance, well-formedness checking and state space traversal [1,2]. However, the incremental computation of transitive closure in graph pattern matching has started to be investigated only recently [3]. In this paper, we propose multiple algorithms for the efficient computation of generalized transitive closures. As such, our solutions are capable of computing reachability regions defined by simple graph edges as well as complex binary relationships defined by graph patterns, that may be used in a wide spectrum of modeling problems. We also report on experimental evaluation of our prototypical implementation, carried out within the context of a stochastic system simulation case study.