PDF:
Recursive Graph Pattern Matching: With Magic Sets and Global Search Plans
| Cím | Recursive Graph Pattern Matching: With Magic Sets and Global Search Plans |
| Közlemény típusa | Conference Paper |
| Kiadás éve | 2007 |
| Szerzők | Varró, G., Horváth, Á., and Varró, D. |
| Szerkesztő | Schürr, A., Nagl, M., and Zündorf, A. |
| Konferencia neve | Proc. Third International Workshop and Symposium on Applications of Graph Transormation with Industrial Relevance (AGTIVE 2007) |
| Kiadó | Springer |
| Kulcsszavak | Pattern matching, recursive pattern matching, Viatra |
| Összefoglalás | 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. |
