Re: [Neo4j] Query performance on distinct paths

The shortestPath: shortestPath( (ea)<-[:maps_to*]-(eb) ) before: +VarLengthExpand(All) | 128 | 669618290 | 1494585385 | | (ea)<-[:maps_to*]-(eb) after: | +ShortestPath | 28884702 | 678 | 169955 | | +CartesianProduct | 28884702 | 169955 |0 | Since I ha

Re: [Neo4j] Query performance on distinct paths

Did the change and the time went down to 20 seconds! Incredible. Thanks for the hint! On Tuesday, 17 January 2017 07:59:52 UTC+1, tomasz@closeit.cz wrote: > > Yes, there are indexes. > > I was wondering about the shortest path but I need all the paths that end > at specific nodes, usually

Re: [Neo4j] Query performance on distinct paths

Yes, there are indexes. I was wondering about the shortest path but I need all the paths that end at specific nodes, usually they will not be the shortests. I will try to see if the results are the same with this modification. On Tuesday, 17 January 2017 03:31:59 UTC+1, Michael Hunger wrote: >

[Neo4j] Query performance on distinct paths

Hi, I have a very expensive query that I'm trying to figure out how to optimise. match (ea:nodeType1 {name:"something1"})<-[:maps_to*]-(eb:nodeType1) with distinct ea, eb match (eb) where eb.fullname starts with "something" return ea.name , eb.name ; I've used