Query is failing "MATCH (i)-[e]->(o) where id(i) == 'ABC' or id(o) == 'ABC' return e;"

[xs2tarunkukreja]

I am trying to find all relationship with an vertex (either in or out).

When I run "MATCH (i)-[e]->(o) where id(i) == 'ABC' return e;" or "MATCH (i)-[e]->(o) where id(o) == 'ABC' return e;" - Both work fine.

But when I run "MATCH (i)-[e]->(o) where id(i) == 'ABC' or id(o) == 'ABC' return e;" - It throw an error "Scan vertices or edges need to specify a limit number, or limit number can not push down.".

Is there any way to find all the relationship in one query.

[wey-gu]

MATCH (i)-[e]-() WHERE id(i) == 'ABC' RETURN e;

[xs2tarunkukreja]

Thanks.. I will check your suggestion. But I am not sure.. why my query is not working? But the partial queries are working successfully.

Would you please guide me to know the reason of error?

[xs2tarunkukreja]

Yeah, it appear as your solution is working.. Please guide me to know why my query is not working.

[wey-gu]

It's a unnecessary filter condition thus not yet verified, could you please help report an issue for that, you can share the execution plan in the issue, too.

Just query with prefix: explain like: explain match...

[xs2tarunkukreja]

Ok.. Should I report the issue?

[wey-gu]

I reported here #5583

The issue here is that, instead of do "We know start node" search, this query was planned to scan(index or data) and filter vid from all, which is not optimal, and before 3.5.0, full scan of data without LIMIT sampling is not allowed(but it's changed in 3.5.0), thus you hit this error, although you wouldn't hit error in 3.5.0, it's not recommended to do this query as it's too expansive.

My suggested query expressed the equivalent but will be optimized to explicitly seek the starting node :) as -- refers to --> or <--.