[Neo4j] Help us to get Neoclipse for neo4j 2.1 released

2014-10-15 Thread Michael Hunger
Hi, if anyone of you is an experienced eclipse developer, we could really need some help getting the new Version of Neoclipse released. This is a maintenance update to Neo4j 2.x, adding read-transactions and some other small things (no label support yet). Unfortunately somehow the eclipse build

Re: [Neo4j] Re: Neo4j complex cypher query slow performace

2014-10-15 Thread Michael Hunger
It is definitely possible if you could share your data with me, I can have a look tomorrow. Michael On Wed, Oct 15, 2014 at 7:36 PM, Nikita Sushkov wrote: > Is there a way to make this query perform about 0.1 sec on such amout of > data or its impossible with neo4j? I > > среда, 15 октября 2014

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread gg4u
Profile for the last query: profile MATCH p = (n:Topic)-[*..2]-(m:Topic) where n.name = 'Topic66' and m.name = 'Topic111' with p, n, m return p, reduce(totProximity = 0, n IN relationships(p)| totProximity + n.proximity) AS pathProximity order by pathProximity; ==> 2411 rows ==> ==> ColumnFilt

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread gg4u
Sure, I tried three examples with (n), (n:Topic) and allShortestPath() and also profiling them: 1. *MATCH p = (n:Topic)-[*0..2]-(m:Topic) where n.name = 'Topic1' and m.name = 'Topic2'return p, reduce(totProximity = 0, n IN relationships(p)| totProximity + n.proximity) AS pathProximity

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread Michael Hunger
Can you just try this please? MATCH p = (n:Topic)-[*0..2]-(m:Topic) where n.name = 'Topic1' and m.name = 'Topic2' return p, reduce(totProximity = 0, n IN relationships(p)| totProximity + n.proximity) AS pathProximity order by pathProximity DESC LIMIT 6; On Wed, Oct 15, 2014 at 2:52 PM, gg4

Re: [Neo4j] Re: Neo4j complex cypher query slow performace

2014-10-15 Thread Nikita Sushkov
Is there a way to make this query perform about 0.1 sec on such amout of data or its impossible with neo4j? I среда, 15 октября 2014 г., 21:32:42 UTC+4 пользователь Nikita Sushkov написал: > > Hi, I'm reopening this question since query performance degraded again to > 10 sec for modified query

Re: [Neo4j] Re: Neo4j complex cypher query slow performace

2014-10-15 Thread Nikita Sushkov
Hi, I'm reopening this question since query performance degraded again to 10 sec for modified query: MATCH (comp:Company {id: 7})-[:HAS_SPACE]->(s:Space)-[:HAS_BOARD]->(b) WITH distinct s, b MATCH (col)<-[:HAS_COLUMN]-(b)-[:HAS_LANE]->(lane) OPTIONAL MATCH (b)-[:HAS_CARD]->(card {archived: fal

[Neo4j] Re: Better docs please

2014-10-15 Thread Rodger
Here's another suggestion. In the LOAD CSV docs: http://docs.neo4j.org/chunked/stable/cypherdoc-importing-csv-files-with-cypher.html there is no clear example of how to import a File. While File is mentioned as an option, the actual examples show HTTP. --- After a number of searches, I fin

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread gg4u
Hi Michael, sorry I don't understand what it means. Can I help you in helping me sorting out the issue somehow? :) What could I check or correct ? What is a pattern matcher and can you teach in reading the profile for making your conclusion? Which may be possible reasons for selecting wrong patt

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread Michael Hunger
Hi, from the profiling it seems that Cypher selects the wrong pattern matcher if we separate the node-lookup and path-match. profile MATCH p = (n:Topic)-[*0..2]-(m:Topic) where n.name = 'Topic1' and m.name = 'Topic2' return p, reduce(totProximity = 0, n IN relationships(p)| totProximity + n.p

Re: [Neo4j] Set time out for embedded Neo4j server in java program

2014-10-15 Thread Michael Hunger
It is more involved there for embedded use you have to set the appropriate kernel configuration and install the guard in the current thread in the webserver that's done with a filter in your own code you'd have to do it yourself per thread. We do it here: enable the guard in the kernel: https:/

Re: [Neo4j] Help me to make the query effective and working

2014-10-15 Thread Michael Hunger
Then there are multiple duplicate rows, you can do it like this: You make them first into distinct values, and then sum the counts of the distinct rows. to check MATCH (genre:Genre)-[:HAS_CHANNEL]->(channel:Channel)-[:HAS_PROGRAM]->(program:Program)- [r]->(x)-[r2]->(y) RETURN DISTINCT genre.name

Re: [Neo4j] Re: EXTRACT not working

2014-10-15 Thread Michael Hunger
Answered on stackoverflow: http://stackoverflow.com/a/26379018/728812 Please don't cross-post. On Wed, Oct 15, 2014 at 11:19 AM, Alex winter wrote: > I think > you can't not use multiple items after | > you can do like: > extract (n in nodes(p)| id(n) ), extract (n in nodes(p)| label(n)) > > >

[Neo4j] Re: EXTRACT not working

2014-10-15 Thread Alex winter
I think you can't not use multiple items after | you can do like: extract (n in nodes(p)| id(n) ), extract (n in nodes(p)| label(n)) On Wednesday, October 15, 2014 11:01:05 AM UTC+2, Mohamed Zahoor wrote: > > I am trying to run some demo example... and this extract query seems to > give error > >

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread gg4u
Hi Rodger, thank you for your page on blog: useful for next steps (I see also extracting paths and nodes belonging to first, second and so on generations) !! a quick note on what you suggested: MATCH (*) Return count(*); ==> SyntaxException: Invalid input '*': expected whitespace, an identifier

[Neo4j] EXTRACT not working

2014-10-15 Thread Mohamed Zahoor
I am trying to run some demo example... and this extract query seems to give error MATCH p = (node0:Movie) WHERE node0.title = "Apollo 13" RETURN EXTRACT(n in nodes(p) | (ID(n),LABEL(n) )) The problem comes only if i give multiple items after "|" i am sure i am missing something simple... b

Re: [Neo4j] Traversing Large (weighted) graphs: performance, data structure, indexes

2014-10-15 Thread gg4u
Hi Micheal, your aggregation was only on the same paths, so you get 9 different paths > but you didn't show the counts per path. > not clear to me yet; I am gonna post results for each query you suggested to try out. Rodger, to summarize a description of this test: 4M nodes labeled 'Topic' 1