You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When I reverse a graph looking for a path MATCH (from), (to), p = shortestPath((from) - [*..15] - (to)), usually I can filter the relationships found along the way by (using the movie ontology example): WHERE all(r IN relationships(path) WHERE type(r) = "ACTED_IN")
However, if along the path, I do not care if the relationship is "ACT_IN" or "PRODUCED" or "DIRECTED", I hope to be able to apply the filter based on a broader concept "WORKED_IN", such as: WHERE all(r IN relationships(path) WHERE n10s.inference.isTypeRel(r) = "WORK_IN")
Could you please design a function that can perform inference on hierarchy of relations?
The text was updated successfully, but these errors were encountered:
When I reverse a graph looking for a path
MATCH (from), (to), p = shortestPath((from) - [*..15] - (to))
, usually I can filter the relationships found along the way by (using the movie ontology example):WHERE all(r IN relationships(path) WHERE type(r) = "ACTED_IN")
However, if along the path, I do not care if the relationship is "ACT_IN" or "PRODUCED" or "DIRECTED", I hope to be able to apply the filter based on a broader concept "WORKED_IN", such as:
WHERE all(r IN relationships(path) WHERE n10s.inference.isTypeRel(r) = "WORK_IN")
Could you please design a function that can perform inference on hierarchy of relations?
The text was updated successfully, but these errors were encountered: