Efficient model transformations by combining pattern matching strategies

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

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

8 Citations (Scopus)

Abstract

Recent advances in graph pattern matching techniques have demonstrated at various tool contests that graph transformation tools can scale up to handle very large models in model transformation problems. In case of local-search based techniques, pattern matching is driven by a search plan, which provides an optimal ordering for traversing and matching nodes and edges of a graph pattern. In case of incremental pattern matching, matches of a pattern are explicitly stored and incrementally maintained upon model manipulation, which frequently provides significant speed-up but with increased memory consumption. In the current paper, we present a hybrid pattern matching approach, which is able to combine local-search and incremental techniques on a per-pattern basis. Based upon experimental evaluation, we identify scenarios when such combination is highly beneficial, and provide guidelines for transformation designers for optimal selection of pattern matching strategy.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages20-34
Number of pages15
Volume5563 LNCS
DOIs
Publication statusPublished - 2009
EventTheory and Practice of Model Transformations - Second International Conference, ICMT 2009, Proceedings - Zurich, Switzerland
Duration: Jun 29 2009Jun 30 2009

Publication series

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

Other

OtherTheory and Practice of Model Transformations - Second International Conference, ICMT 2009, Proceedings
CountrySwitzerland
CityZurich
Period6/29/096/30/09

Fingerprint

Pattern matching
Model Transformation
Pattern Matching
Local Search
Graph Transformation
Scale-up
Graph in graph theory
Experimental Evaluation
Manipulation
Speedup
Strategy
Data storage equipment
Scenarios
Vertex of a graph
Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bergmann, G., Horváth, Á., Ráth, I., & Varró, D. (2009). Efficient model transformations by combining pattern matching strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5563 LNCS, pp. 20-34). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5563 LNCS). https://doi.org/10.1007/978-3-642-02408-5_3

Efficient model transformations by combining pattern matching strategies. / 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. 5563 LNCS 2009. p. 20-34 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5563 LNCS).

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

Bergmann, G, Horváth, Á, Ráth, I & Varró, D 2009, Efficient model transformations by combining pattern matching strategies. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5563 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5563 LNCS, pp. 20-34, Theory and Practice of Model Transformations - Second International Conference, ICMT 2009, Proceedings, Zurich, Switzerland, 6/29/09. https://doi.org/10.1007/978-3-642-02408-5_3
Bergmann G, Horváth Á, Ráth I, Varró D. Efficient model transformations by combining pattern matching strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5563 LNCS. 2009. p. 20-34. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02408-5_3
Bergmann, Gábor ; Horváth, Ákos ; Ráth, István ; Varró, D. / Efficient model transformations by combining pattern matching strategies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5563 LNCS 2009. pp. 20-34 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{aee65332c9a04df1b9e955625dc12673,
title = "Efficient model transformations by combining pattern matching strategies",
abstract = "Recent advances in graph pattern matching techniques have demonstrated at various tool contests that graph transformation tools can scale up to handle very large models in model transformation problems. In case of local-search based techniques, pattern matching is driven by a search plan, which provides an optimal ordering for traversing and matching nodes and edges of a graph pattern. In case of incremental pattern matching, matches of a pattern are explicitly stored and incrementally maintained upon model manipulation, which frequently provides significant speed-up but with increased memory consumption. In the current paper, we present a hybrid pattern matching approach, which is able to combine local-search and incremental techniques on a per-pattern basis. Based upon experimental evaluation, we identify scenarios when such combination is highly beneficial, and provide guidelines for transformation designers for optimal selection of pattern matching strategy.",
author = "G{\'a}bor Bergmann and {\'A}kos Horv{\'a}th and Istv{\'a}n R{\'a}th and D. Varr{\'o}",
year = "2009",
doi = "10.1007/978-3-642-02408-5_3",
language = "English",
isbn = "3642024076",
volume = "5563 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "20--34",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Efficient model transformations by combining pattern matching strategies

AU - Bergmann, Gábor

AU - Horváth, Ákos

AU - Ráth, István

AU - Varró, D.

PY - 2009

Y1 - 2009

N2 - Recent advances in graph pattern matching techniques have demonstrated at various tool contests that graph transformation tools can scale up to handle very large models in model transformation problems. In case of local-search based techniques, pattern matching is driven by a search plan, which provides an optimal ordering for traversing and matching nodes and edges of a graph pattern. In case of incremental pattern matching, matches of a pattern are explicitly stored and incrementally maintained upon model manipulation, which frequently provides significant speed-up but with increased memory consumption. In the current paper, we present a hybrid pattern matching approach, which is able to combine local-search and incremental techniques on a per-pattern basis. Based upon experimental evaluation, we identify scenarios when such combination is highly beneficial, and provide guidelines for transformation designers for optimal selection of pattern matching strategy.

AB - Recent advances in graph pattern matching techniques have demonstrated at various tool contests that graph transformation tools can scale up to handle very large models in model transformation problems. In case of local-search based techniques, pattern matching is driven by a search plan, which provides an optimal ordering for traversing and matching nodes and edges of a graph pattern. In case of incremental pattern matching, matches of a pattern are explicitly stored and incrementally maintained upon model manipulation, which frequently provides significant speed-up but with increased memory consumption. In the current paper, we present a hybrid pattern matching approach, which is able to combine local-search and incremental techniques on a per-pattern basis. Based upon experimental evaluation, we identify scenarios when such combination is highly beneficial, and provide guidelines for transformation designers for optimal selection of pattern matching strategy.

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

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

U2 - 10.1007/978-3-642-02408-5_3

DO - 10.1007/978-3-642-02408-5_3

M3 - Conference contribution

SN - 3642024076

SN - 9783642024078

VL - 5563 LNCS

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

SP - 20

EP - 34

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

ER -