|
SENSORIA All Publications |
|
Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
show main publications
Recursive Graph Pattern Matching: With Magic Sets and Global Search Plans
@INPROCEEDINGS{VHV,
title = {{Recursive Graph Pattern Matching: With Magic Sets and Global Search Plans}},
author = {{D\'aniel} {Varr\'o} and {\'Akos} {Horv\'ath} and {Gergely} {Varr\'o}},
booktitle = {Proc. Third International Workshop and Symposium on Applications of Graph Transormation with Industrial Relevance (AGTIVE 2007)},
editor = {Andy Schurr and Manfred Nagl and Albert Zundorf},
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.},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {5088},
partner = {BUTE},
task = {T7.1},
}
|
