[Neo4j] Neo4j Community Memory Usage

2016-06-25 Thread Marcus Baffa
Hi, I am working with Neo4j Community and my application is inserting something like 10 nodes per second. It is working ok but the memory usage is always going up. How can I configure it to stop the memory usage from growing and use, for instance, the swap files ? Thanks -- You received

[Neo4j] Add and edit nodes in visual mode

2016-06-25 Thread Александр Присмотров
Hello! Can I add and edit nodes in visual mode? Did not find such opportunity. -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+unsubscr...@googlegroups.com. For

[Neo4j] Is Cypher-3.0 queries are slower than Traversal API or Procedures !!

2016-06-25 Thread Gurpreet Singh
Guys, i am working on Neo4j-3.0 enterprise database, i have 1 billion around data which is connected each other. Right now, i am using Cypher-3.0 queries to search friends upto 3rd level depth and i have seen that its taking lot of time like 1/2 minutes or more than that. i have already

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

2016-06-25 Thread 'Michael Hunger' via Neo4j
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

2016-06-25 Thread idor
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

2016-06-25 Thread 'Michael Hunger' via Neo4j
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

2016-06-25 Thread idor
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)