Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans | Zendy

Gergely Varró | Zendy; Katalin Friedl | Zendy; Dániel Varró | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans

Author(s) -

Gergely Varró,

Katalin Friedl,

Dániel Varró

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.10.025

Subject(s) - computer science , matching (statistics) , graph , 3 dimensional matching , theoretical computer science , artificial intelligence , mathematics , bipartite graph , statistics

The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for pattern traversal (as an extension to traditional multiplicity and type considerations of existing tools) by estimating the expected performance of search plans on typical instance models that are available at transformation design time. Then, an adaptive approach for graph pattern matching is presented, where the optimal search plan can be selected from previously generated search plans at run-time based on statistical data collected from the current instance model under transformation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research