@inproceedings {agtive07-vhv, title = {Recursive Graph Pattern Matching: With Magic Sets and Global Search Plans}, booktitle = {Proc. Third International Workshop and Symposium on Applications of Graph Transormation with Industrial Relevance (AGTIVE 2007)}, series = {Lecture Notes in Computer Science}, volume = {5088}, year = {2007}, publisher = {Springer}, organization = {Springer}, 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.

}, keywords = {Pattern matching, recursive pattern matching, Viatra}, author = {Gergely Varr{\'o} and {\'A}kos Horv{\'a}th and D{\'a}niel Varr{\'o}}, editor = {Andy Sch{\"u}rr and Manfred Nagl and Albert Z{\"u}ndorf} }