Re: [Neo4j] Optimizing ShortestPath query for a better performances

Hi Michael, I did experiments with your suggested query. with shortest path I got much lesser DB hits. my query (with shortest path) PROFILE MATCH p=shortestPath((user:User{userId:'userId123'})-[r*1..3]-(f: User)) WHERE f <> user RETURN * result:

Re: [Neo4j] Optimizing ShortestPath query for a better performances

On Sat, Jun 25, 2016 at 10:23 PM, idor wrote: > Hi Michael, > Thanks for replying. > > scale it out on a scluster. > > > It requiresNeo4j entreprise license isnt it? > It will require neo4j enterprise. Which license depends on your use-case and company. > > Why do you

Re: [Neo4j] Optimizing ShortestPath query for a better performances

Hi Michael, Thanks for replying. scale it out on a scluster. It requiresNeo4j entreprise license isnt it? Why do you string-concatinate the dist property? > On each relation we have a numeric property that we want to aggregate later on. if A connected to D this way (A->B->C>D) we need the

Re: [Neo4j] Optimizing ShortestPath query for a better performances

Hi, for what you do shortest Path is not the right solution, as you don't wan the path between two nodes but the neighborhood of one node. Also having that many connections when you don't have the CPUs to process it doesn't make sense, scale it out on a scluster. Why do you string-concatinate

[Neo4j] Optimizing ShortestPath query for a better performances

I have in my graph ~1M nodes and ~1M relations. My motivation for query is to retrieve all related nodes(by 3 hops) of specific source node + aggregate properties within the response. I understood the shortestPath taking your sourceNode and query all other nodes(not necessarily related ones)