Actually, if I config
org.neo4j.server.webserver.limit.executiontime=1000
but I use neo4j-shell. It also doesn't work.
Could you explain a bit for me?
Thanks
On Monday, October 13, 2014 12:21:40 PM UTC+2, Alex winter wrote:
>
> Thank Michael.
> Actually I found the article and I did it before
Michael,
I'm getting the following result:
++
| genre.name | channel.name | program.name | sum(r2.count) |
+---
Sorry typo, fixed below
Von meinem iPhone gesendet
> Am 15.10.2014 um 05:23 schrieb Sukaant Chaudhary
> :
>
> Michael,
> I'm sorry but, it is the part of the same problem.
>
> MATCH
> (genre:Genre)-[:HAS_CHANNEL]->(channel:Channel)-[:HAS_PROGRAM]->(program:Program)-
> [r]->(x)-[r2]->(y)
> RE
How many rows does this return?
MATCH (n:Topic) , (m:Topic), p = (n)-[*0..2]-(m) where n.name = 'Topic1'
and m.name = 'Topic2' with p, n, m return p, count(*) order by count(*);
your aggregation was only on the same paths, so you get 9 different paths
but you didn't show the counts per path.
and
Hello again,
Actually when I mentioned the shell, I was referring to
the character shell. On Linux, run with
./neo4j-shell
Although, if you are only getting 9 rows back, this shouldn't make much
difference.
-
Looking at these two queries:
MATCH (n:Topic) , (m:Topic), p = (n)-[*0..2]
Hello,
I am using spring data for neo4j and it appears that insertion of elements
is very slow (around 50 nodes /s) with the embedded graphdatabase.
The type of the node is "Publication"and contains a lot of differents nodes
linked by a lot of relationship (one Publication generates around 30 ot
Thanks Michael!
~A
On Mon, Oct 13, 2014 at 6:57 PM, Michael Hunger <
michael.hun...@neotechnology.com> wrote:
> The more recent versions use and index for your IN query, so it will
> actually use an index or constraint in this case, that fix was added after
> 2.0.3 though.
>
>
>
> On Mon, Oct 13
Hi Craig,
I use my own id-mapping data structure (hashmap). What you said about
lucene is interesting, becuase yesterday I thought about doing so.
What I do now, first I create the nodes for point geometries, then I start
creating polygon nodes, extract the list of edges for each polygon, cr
Hi Alireza,
Sounds like you need a unique key to connect vertices during the edges
import. You called this the 'vertix id'. We had the same problem importing
OSM data in the OSMImporter class. In that code we used the lucene index to
store the osm-id for the vertices. This works fine for moderate
Yes:
neo4j-sh (?)$ profile MATCH (n:Topic), (m:Topic) where n.name = 'Topic1'
and m.name = 'Topic2' MATCH p = (n)-[*0..2]-(m) return p,
reduce(totProximity = 0, n IN relationships(p)| totProximity + n.proximity)
AS pathProximity order by pathProximity DESC LIMIT 6;
==>
[...results...]
==>
Hi Craig,
What would be the best way to import such data into Neo4j.
The sample file that I have first list all vertices with their coordinates
and then
all polygons with the list of their corresponding vertex id list.
The edges are inferred from this two list.
My current script is extreme
Hi Michael,
I wasn't using it directly but blueprints had a dependency on opencsv 2.0
and that was the reason for the conflict. I just updated my build.sbt file
overriding the opencsv dependency to 2.3 and everything seems to work fine
now.
Cheers,
Pablo
On Sun, Oct 12, 2014 at 12:40 PM, Michae
Can you try this:
profile
MATCH (n:Topic), (m:Topic)
where n.name = 'Topic1' and m.name = 'Topic2'
MATCH p = (n)-[*0..2]-(m)
return p, reduce(totProximity = 0, n IN relationships(p)| totProximity +
n.proximity) AS pathProximity
order by pathProximity DESC
LIMIT 6
On Tue, Oct 14, 2014 at 9:06
Hi Rodjer,
thank you for your insights!
please see comments below:
Il giorno lunedì 13 ottobre 2014 18:37:50 UTC+2, Rodger ha scritto:
>
> Hello,
>
> I've done a lot of RDBMS performance tuning.
> Just a few quick thoughts.
>
>
> Be sure to run the queries in the shell, if you are not already doi
14 matches
Mail list logo
