ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
PVLDB
2010
13 years 6 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
ENTCS
2006
13 years 7 months ago
2006
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...