这个cql
match p=(n)-[*0..6]-(m)
where id(n)=487682 and id(m)= 487671 with p
where ALL(x IN nodes(p)
WHERE SINGLE(y IN nodes(p)
WHERE x=y))
and all(x in nodes(p)[1..length(p)]
where x.name='1444')
and all(x in relationships(p)
where x.RELATIONSHIP_RANK>'67')
return p
可以优化吗?当我使用这个 cql 查询时,花了很长时间。任何帮助都会得到帮助。