Recursive Graph Pattern Matching

Authors:
Gergely Varró;Ákos Horváth;Dániel Varró
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics,;Department of Measurement and Information Systems, Budapest University of Technology and Economics,;Department of Measurement and Information Systems, Budapest University of Technology and Economics,
Venue:
Applications of Graph Transformations with Industrial Relevance
Year:
2008

Citing 8
Cited 4

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Graph transformation units and modules

Handbook of graph grammars and computing by graph transformation
The FUJABA environment

Proceedings of the 22nd international conference on Software engineering
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies

Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Graph Pattern Matching in PROGRES

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Advanced model transformation language constructs in the VIATRA2 framework

Proceedings of the 2006 ACM symposium on Applied computing
Reusable Idioms and Patterns in Graph Transformation Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans

Electronic Notes in Theoretical Computer Science (ENTCS)

Shaped Generic Graph Transformation

Applications of Graph Transformations with Industrial Relevance
Efficient Model Transformations by Combining Pattern Matching Strategies

ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Applying incremental graph transformation to existing models in relational databases

ICGT'12 Proceedings of the 6th international conference on Graph Transformations
A collection operator for graph transformation

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present core data structures and algorithms for matching graph patterns with general recursion. Our approach uses magic sets, a well-known technique from deductive databases, which combines fixpoint-based bottom-up query evaluation with top-down handling of input parameters. Furthermore, this technique is enhanced with the global search plans, thus non-recursive calls are always flattened before elementary pattern matching operations are initiated in order to improve performance. Our approach is exemplified using Viatra2 .