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
@Article{gtvmt2007-horvath-varro-varro,
author = { \'{A}kos Horv\'{a}th and Gergely Varr\'{o} and D\'{a}niel Varr\'{o}},
title = {Generic Search Plans for Matching Advanced Graph Patterns},
issn = {1863-2122},
volume = 6,
journal = {Electronic Communications of the ECEASST},
year = {2007},
abstract = {
In the current paper, we present search plans which can guide pattern
matching for advanced graph patterns with edge identities, containment constraints,
type variables, negative application conditions, attribute conditions, and injectivity
constraints. Based on a generic search graph representation, all search plan operations
(e.g. checking the existence of an edge, or extending a matching candidate
by navigating along an edge) are uniformly represented as special predicates with
heuristically assigned costs. Finally, an executable search plan is defined as an appropriate
ordering of these predicates. As a main consequence, attribute, injectivity,
and negative application conditions can be checked early (but not unnecessarily
early) in the pattern matching process to cut off infeasible matching candidates at
the right time.},
keywords = {graph pattern matching, search plan}
}
|