Incremental pattern matching in the viatra model transformation system

Bergmann, Gábor; Ökrös, András; Ráth, István; Varró, Dániel; Varró, Gergely

doi:10.1145/1402947.1402953

Cited by 49 publications

(44 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[11]) such as [7] and VI-ATRA [4] that can be conceptually mapped to MSGDN. In these cases the RETE network structure supports only at most two direct dependencies like MSGDN and the computations of the nodes of the RETE network can be matched to the four permitted cases of MSGDN.…”

Section: Discussionmentioning

confidence: 99%

“…The model of typed graphs and related graph queries to explore existing graphs and their properties has lately gained increased importance due to application areas of increasing relevance such as social networks, biological networks, and model queries [15] and technologies like graph databases [2] or model-driven development [4] where graphs rather than relations are the main characteristics of the employed models and queries.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Operationalization of Graph Queries with Generalized Discrimination Networks

Beyhl

Blouin

Giese

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Graph queries have lately gained increased interest due to application areas such as social networks, biological networks, or model queries. For the relational database case the relational algebra and generalized discrimination networks have been studied to find appropriate decompositions into subqueries and ordering of these subqueries for query evaluation or incremental updates of query results. For graph database queries however there is no formal underpinning yet that allows us to find such suitable operationalizations. Consequently, we suggest a simple operational concept for the decomposition of arbitrary complex queries into simpler subqueries and the ordering of these subqueries in form of generalized discrimination networks for graph queries inspired by the relational case. The approach employs graph transformation rules for the nodes of the network and thus we can employ the underlying theory. We further show that the proposed generalized discrimination networks have the same expressive power as nested graph conditions.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Operationalization of Graph Queries with Generalized Discrimination Networks

Beyhl

Blouin

Giese

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…3) Incremental Graph Pattern Matching using the Rete algorithm: Incremental pattern matching [3], [13] is an alternative pattern matching approach that explicitly caches matches. This makes the results available at any time without further searching, however, the cache needs to be incrementally updated whenever changes are made to the model.…”

Section: B Definition Of Model Queries Using Graph Patternsmentioning

confidence: 99%

“…EMF models are frequently post-processed by advanced model query techniques based on graph pattern matching exploiting different strategies such as local search [2] or incremental evaluation [3]. Some of these approaches have demonstrated to scale up for large models with millions of elements in forward engineering scenarios, but up to now, no systematic investigation has been carried out to show if they are efficiently applicable as a program query technology.…”

Section: Introductionmentioning

confidence: 99%

Anti-pattern detection with model queries: A comparison of approaches

Ujhelyi

Horváth

Varró

et al. 2014

2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)

View full text Add to dashboard Cite

Abstract-Program queries play an important role in several software evolution tasks like program comprehension, impact analysis, or the automated identification of anti-patterns for complex refactoring operations. A central artifact of these tasks is the reverse engineered program model built up from the source code (usually an Abstract Semantic Graph, ASG), which is traditionally post-processed by dedicated, hand-coded queries. Our paper investigates the use of the popular industrial Eclipse Modeling Framework (EMF) as an underlying representation of program models processed by three general-purpose model query techniques based on native Java code, local-search and incremental evaluation. We provide in-depth comparison of these techniques on the source code of 17 Java projects using queries taken from refactoring operations in different usage profiles. Our results show that general purpose model queries outperform hand-coded queries by 2-3 orders of magnitude, while there is a 5-10 times increase in memory consumption and model load time. In addition, measurement results of usage profiles can be used as guidelines for selecting the appropriate query technologies in concrete scenarios.

show abstract

“…In particular, it shares our ability to compute different alternative solutions through combinatorial logic inference. A number of so-called incremental approaches [13,29,4] allow to update a target model by taking into account incremental changes to the source model. Triple Graph Grammars (TGGs) [27] are an approach for defining correspondences between two graphs.…”

Section: Related Workmentioning

confidence: 99%

Transformation as Search

Kleiner

Fabro

Santos

2013

Modelling Foundations and Applications

View full text Add to dashboard Cite

is an open access repository that collects the work of Arts et Métiers ParisTech researchers and makes it freely available over the web where possible. Abstract. In model-driven engineering, model transformations are considered a key element to generate and maintain consistency between related models. Rule-based approaches have become a mature technology and are widely used in different application domains. However, in various scenarios, these solutions still suffer from a number of limitations that stem from their injective and deterministic nature. This article proposes an original approach, based on non-deterministic constraint-based search engines, to define and execute bidirectional model transformations and synchronizations from single specifications. Since these solely rely on basic existing modeling concepts, it does not require the introduction of a dedicated language. We first describe and formally define this model operation, called transformation as search, then describe a proof-of-concept implementation and discuss experiments on a reference use case in software engineering.

show abstract

Incremental pattern matching in the viatra model transformation system

Cited by 49 publications

References 20 publications

On the Operationalization of Graph Queries with Generalized Discrimination Networks

On the Operationalization of Graph Queries with Generalized Discrimination Networks

Anti-pattern detection with model queries: A comparison of approaches

Transformation as Search

Contact Info

Product

Resources

About