Re: [Neo4j] neo4j.py install problems

Anyone? Also whats the current status of neo4j.py? I read somewhere it was being updated some time ago. -- View this message in context: http://neo4j-community-discussions.438527.n3.nabble.com/neo4j-py-install-problems-tp3191386p3194919.html Sent from the Neo4j Community Discussions mailing

Re: [Neo4j] neo4j.py install problems

Eddy, Jake is working on it right now, what is the state Jake? Cheers, /peter neubauer GTalk:      neubauer.peter Skype       peter.neubauer Phone       +46 704 106975 LinkedIn   http://www.linkedin.com/in/neubauer Twitter      http://twitter.com/peterneubauer http://www.neo4j.org              

Re: [Neo4j] paging

Hi Pieter, Jim recently added support for paging in the Neo4j server for traversals, For Cypher, there is SKIP and LIMIT, together acting as a kind of paging system, but executing the query again (just giving you a different chunk of the result), so I am not sure that works for your case.

Re: [Neo4j] nested transactions feature ?

Hi there, yes, nested transactions are really using the most topmost transaction for control, so your assessment if the commit semantics is right (I think). Talked to Tobias about this, and maybe we could state this more clearly in the docs. Got any good working we could change to? Feel free to

Re: [Neo4j] paging

Btw, the pages traverser is convered here: http://docs.neo4j.org/chunked/snapshot/rest-api-traverse.html#rest-api-creating-a-paged-traverser Would love to see support throughout the whole REST API for it. Cheers, /peter neubauer GTalk:      neubauer.peter Skype       peter.neubauer Phone      

Re: [Neo4j] More spatial questions

Mmh, you are looking not for the next node on a way but the nearest? In that case, you maybe coudl index all OSM nodes in a new layer ALL_NODES, then fish out the next node on the way, and do a search for nodes closer that this and check if they are on your way? Cheers, /peter neubauer GTalk:   

Re: [Neo4j] help for Traverser

Sulabh, if you want to get the property relationships, I would either get these during the iteration of the nodes you get back (thus in some way duplicating the Evaluator in the result iteration, but you could possibly refactor that into one method), or during the traversal build up a resultset

Re: [Neo4j] shortestPath slower than it could be

Thanks Mattias. The way I understand what you said is, that swapping `one` and `two` in *finder.findSinglePath( one, two );* should yield the same timing when Direction.BOTH is used; this would be great. But I don't see how this is possible (due to not knowing how it's stored too) unless you know

Re: [Neo4j] nested transactions feature ?

Hey Peter, Got any good working we could change to? I'm not sure I understand what you mean, do you mean that if I have any good text to add to the javadoc so it's stated more clearly ? or something related to code instead? but if code, to do what? I understand that they are using the topmost

Re: [Neo4j] shortestPath slower than it could be

What I'm saying is that: one -- two(one,two) for OUTGOING and two -- one (two,one) for INCOMING should yield the same timing. 2011/7/24 John cyuczieekc cyuczie...@gmail.com Thanks Mattias. The way I understand what you said is, that swapping `one` and `two` in

Re: [Neo4j] nested transactions feature ?

Thanks John for the details! As for the GIThub workflow: http://www.eqqon.com/index.php/Collaborative_Github_Workflow and http://help.github.com/ are good starting points! Cheers, /peter neubauer GTalk:      neubauer.peter Skype       peter.neubauer Phone       +46 704 106975 LinkedIn  

Re: [Neo4j] shortestPath slower than it could be

but, even when `one` has 1 million outgoing rels and `two` has 10 or 11 incoming rels cool then ;) I was trying to say the same thing ... Have a nice day, John. On Sun, Jul 24, 2011 at 4:10 PM, Mattias Persson matt...@neotechnology.comwrote: What I'm saying is that: one -- two(one,two)

Re: [Neo4j] shortestPath slower than it could be

Are you sure this is true, Mattias?The response time of a getRelationship call depends on the total number of relationships on the node. So it makes a difference which side of the relationship makes the call. It is always faster to ask it from the side that has the lowest total number of

Re: [Neo4j] shortestPath slower than it could be

It doesn't matter since the algorithm is bi-directional... so: one -- two will start from one OUTGOING and two INCOMING, whereas two -- one will start from two INCOMING and one OUTGOING see, no difference. It alternates side for each relationship. It will, however depend on where

Re: [Neo4j] shortestPath slower than it could be

updated to latest from github, Stops the algo as soon as possible in findSinglePath graphdb contains: one--three one--{ a million other random nodes } one--two { 10 random nodes } -- two (added in that order, except that `one--two` is somewhere between those 10 random nodes) output: with

Re: [Neo4j] shortestPath slower than it could be

ok fully reverting the entire project worked (that is without that fix): with Direction.BOTH: (one)--(three) 8,438 ms (one)--(two) 873 ms (three)--(one) 0 ms (two)--(one) 0 ms (one)--(three) 734 ms (one)--(two) 743 ms (three)--(one) 0 ms (two)--(one) 0 ms (one)--(three) 784 ms (one)--(two) 621 ms

[Neo4j] GSoC 2011 Weekly report - OSM data mining and editing capabilities in uDig and Geotools

==Weekly Report== Hi all, this week I studied the uDig tutorials and uDig code to learn how to use the renderers. I made some experiments about OSM data import and editing using JOSM and Potlatch2. Now I'm trying to find a way to edit OSM data directly from uDig and a way to commit (save) the

Re: [Neo4j] shortestPath slower than it could be

I got more creative with the naming and formatting, and I post another output (more intuitively read), the graphdb contains (rels added in this order): ROOT_LIST--START ROOT_LIST--{ 500,000 new unique nodes } ROOT_LIST--MIDDLE ROOT_LIST--{ another set of 500,000 new unique nodes } ROOT_LIST--END

Re: [Neo4j] paging

Hi, For Cypher, there is SKIP and LIMIT, together acting as a kind of paging system, but executing the query again (just giving you a different chunk of the result), so I am not sure that works for your case. http://docs.neo4j.org/chunked/snapshot/cypher-query-lang.html. Gremlin supports

Re: [Neo4j] OSGi and Neo4j - superbundle approach

Jörg, there where several issues Toni and me found when looking at your example. Thanks a lot! First of all, Pax Exam Player using the built-in native OSGi Runner is not emulating the real platform classloading correctly. Toni is at this one, the tests are switched to the PaxRunner instead,

[Neo4j] OSCON beer tomorrow?

Hi all Graphistas. if there is anyone out at OSCON tomorrow, maybe we could meet up at 5.30pm or so ta the Android Happy hour? Let me know, would be cool to have a beer or two :) Cheers, /peter neubauer GTalk:      neubauer.peter Skype       peter.neubauer Phone       +46 704 106975 LinkedIn  

[Neo4j] Enhanced API and HyperRelationships

Today I wrote a piece about the Enhanced API and about HyperRelationships, I have been working on over the last couple of days. See: https://github.com/peterneubauer/graph-collections/wiki/Enhanced-API The API as presented in the graph-collections repo on Git is not feature complete yet with

[Neo4j] Is anyone running the rest server over ssl?

How do I set it up? Thanks! ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

[Neo4j] Course materials code for Graph and Network Analysis freely available

New to graphs? FYI http://mlg.ucd.ie/summer Tim McNamara Professional \\  paperlessprojects.com Personal \\  @timClicks  |  timmcnamara.co.nz ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

[Neo4j] Best library for Clojure?

Hello, Which is the best library for using Neo4j from Clojure? This fork: https://github.com/wagjo/borneo Seems active, and maintained. Any advice or pointers would be appreciated. Don ___ Neo4j mailing list User@lists.neo4j.org