Hi,
Letme explain above query:
I want to get all child events of a grandpa event (orange node). First I identify grandpa by where statement, then I use relation SubEvent to get all child-level-1 of grandpa. Then that's is the basic path of returned path. To full fill the that path, I continue expand the path by other relation (there are only Sub, Causal, Result and Next are relations between event. (other uncased relation are role of events which are Entities) But the above query return path included grandpa (which I don't want) I get consfused the path = (e1)--... from it should start from e1 why it include (e),
Second it would be really nice if you help me to shorten or optimize the query, as that query runs quite long. (Like 2 seconds in a graph just have ~4000 nodes and ~4000 relations )
To make it clearer this is directional graph:r
if (a)->(b) it should be read as the ... of a is b e.g: (a)-sub->(b): the subevent of a is b/ or a has subevent which is b. / (a)-causal->(b) : the reason (a) occurred is b/ or a has causal which is b.