A benchmark evaluation of incremental pattern matching in graph transformation

Gábor Bergmann, Ákos Horváth, István Ráth, D. Varró

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Citations (Scopus)

Abstract

In graph transformation, the most cost-intensive phase of a transformation execution is pattern matching, where those subgraphs of a model graph are identified and matched which satisfy constraints prescribed by graph patterns. Incremental pattern matching aims to improve the efficiency of this critical step by storing the set of matches of a graph transformation rule and incrementally maintaining it as the model changes, thus eliminating the need of recalculating existing matches of a pattern. In this paper, we propose benchmark examples where incremental pattern matching is expected to have advantageous effect in the application domain of model simulation and model synchronization. Moreover, we compare the incremental graph pattern matching approach of Viatra2 with advanced non-incremental local-search based graph pattern matching approaches (as available in Viatra2 and GrGen).

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages396-410
Number of pages15
Volume5214 LNCS
DOIs
Publication statusPublished - 2008
Event4th International Conference on Graph Transformations, ICGT 2008 - Leicester, United Kingdom
Duration: Sep 7 2008Sep 13 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5214 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Graph Transformations, ICGT 2008
CountryUnited Kingdom
CityLeicester
Period9/7/089/13/08

Fingerprint

Graph Transformation
Pattern matching
Pattern Matching
Benchmark
Evaluation
Graph in graph theory
Graph Model
Local Search
Subgraph
Synchronization
Simulation Model
Costs
Model

Keywords

  • Benchmarking
  • Incremental graph pattern matching
  • RETE

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bergmann, G., Horváth, Á., Ráth, I., & Varró, D. (2008). A benchmark evaluation of incremental pattern matching in graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 396-410). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5214 LNCS). https://doi.org/10.1007/978-3-540-87405-8_27

A benchmark evaluation of incremental pattern matching in graph transformation. / Bergmann, Gábor; Horváth, Ákos; Ráth, István; Varró, D.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5214 LNCS 2008. p. 396-410 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5214 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bergmann, G, Horváth, Á, Ráth, I & Varró, D 2008, A benchmark evaluation of incremental pattern matching in graph transformation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5214 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5214 LNCS, pp. 396-410, 4th International Conference on Graph Transformations, ICGT 2008, Leicester, United Kingdom, 9/7/08. https://doi.org/10.1007/978-3-540-87405-8_27
Bergmann G, Horváth Á, Ráth I, Varró D. A benchmark evaluation of incremental pattern matching in graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5214 LNCS. 2008. p. 396-410. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-87405-8_27
Bergmann, Gábor ; Horváth, Ákos ; Ráth, István ; Varró, D. / A benchmark evaluation of incremental pattern matching in graph transformation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5214 LNCS 2008. pp. 396-410 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7ae5770ef3774355aeeda023de3e3dae,
title = "A benchmark evaluation of incremental pattern matching in graph transformation",
abstract = "In graph transformation, the most cost-intensive phase of a transformation execution is pattern matching, where those subgraphs of a model graph are identified and matched which satisfy constraints prescribed by graph patterns. Incremental pattern matching aims to improve the efficiency of this critical step by storing the set of matches of a graph transformation rule and incrementally maintaining it as the model changes, thus eliminating the need of recalculating existing matches of a pattern. In this paper, we propose benchmark examples where incremental pattern matching is expected to have advantageous effect in the application domain of model simulation and model synchronization. Moreover, we compare the incremental graph pattern matching approach of Viatra2 with advanced non-incremental local-search based graph pattern matching approaches (as available in Viatra2 and GrGen).",
keywords = "Benchmarking, Incremental graph pattern matching, RETE",
author = "G{\'a}bor Bergmann and {\'A}kos Horv{\'a}th and Istv{\'a}n R{\'a}th and D. Varr{\'o}",
year = "2008",
doi = "10.1007/978-3-540-87405-8_27",
language = "English",
isbn = "3540874046",
volume = "5214 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "396--410",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A benchmark evaluation of incremental pattern matching in graph transformation

AU - Bergmann, Gábor

AU - Horváth, Ákos

AU - Ráth, István

AU - Varró, D.

PY - 2008

Y1 - 2008

N2 - In graph transformation, the most cost-intensive phase of a transformation execution is pattern matching, where those subgraphs of a model graph are identified and matched which satisfy constraints prescribed by graph patterns. Incremental pattern matching aims to improve the efficiency of this critical step by storing the set of matches of a graph transformation rule and incrementally maintaining it as the model changes, thus eliminating the need of recalculating existing matches of a pattern. In this paper, we propose benchmark examples where incremental pattern matching is expected to have advantageous effect in the application domain of model simulation and model synchronization. Moreover, we compare the incremental graph pattern matching approach of Viatra2 with advanced non-incremental local-search based graph pattern matching approaches (as available in Viatra2 and GrGen).

AB - In graph transformation, the most cost-intensive phase of a transformation execution is pattern matching, where those subgraphs of a model graph are identified and matched which satisfy constraints prescribed by graph patterns. Incremental pattern matching aims to improve the efficiency of this critical step by storing the set of matches of a graph transformation rule and incrementally maintaining it as the model changes, thus eliminating the need of recalculating existing matches of a pattern. In this paper, we propose benchmark examples where incremental pattern matching is expected to have advantageous effect in the application domain of model simulation and model synchronization. Moreover, we compare the incremental graph pattern matching approach of Viatra2 with advanced non-incremental local-search based graph pattern matching approaches (as available in Viatra2 and GrGen).

KW - Benchmarking

KW - Incremental graph pattern matching

KW - RETE

UR - http://www.scopus.com/inward/record.url?scp=56449088620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56449088620&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-87405-8_27

DO - 10.1007/978-3-540-87405-8_27

M3 - Conference contribution

AN - SCOPUS:56449088620

SN - 3540874046

SN - 9783540874041

VL - 5214 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 396

EP - 410

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -