Re: [Neo] MySQL vs. Neo4j in a Breadth-First Graph Traversal

2010-03-29 Thread Peter Neubauer
Yup, that is our assessment, too. On 1-3 joins there is a chance to optimize the queries in an RDBMS. But still you have indexes instead of references, and the overhead of serialization through the JDBC driver. Anyway, it even shows that Java based DBs are not necessarily slower than C based. Then

Re: [Neo] MySQL vs. Neo4j in a Breadth-First Graph Traversal

2010-03-29 Thread Laurent Laborde
Hu... I'm surprised. I expected the test to be unfair in favor of mysql for a simple graph traversal. In fact, i still think that with good mysql configuration and good sql tuning, mysql can be faster. Of course, if you add different kind of relationship, node property, relationship property a

[Neo] MySQL vs. Neo4j in a Breadth-First Graph Traversal

2010-03-29 Thread Marko Rodriguez
Hi guys, Sorry if you have already seen this (Twitter, Gremlin mailing list, etc.), but for those that haven't, this is of potential interest to all you Neo4j users. http://markorodriguez.com/Blarko/Entries/2010/3/29_MySQL_vs._Neo4j_on_a_Large-Scale_Graph_Traversal.html Take care, Marko. http:

Re: [Neo] Collaboration Neo4j/Gephi (was: displaying very large graph)

2010-03-29 Thread Mathieu Bastian
There is no student interested by the Gephi-Neo4j proposal for the moment. It's still time for them to apply. Spread the word :-) Mathieu On Fri, Mar 26, 2010 at 1:20 PM, Craig Taverner wrote: > +1 from me too. I love visualization, use neoclipse a lot, and think large > scale visualization lik

Re: [Neo] Unable to memory map

2010-03-29 Thread Marc Preddie
Hi, I've had some time to look into this issue and it seems that when using the "ReadOnly" versions of the classes, I get the memory mapping warnings and when using the "Writable" versions of the classes, the warning does not occur (I'm assuming memory mapping gets enabled). I'm not against usin

Re: [Neo] Find Dominating Set in a graph,Dead end using Neo4j

2010-03-29 Thread Peter Neubauer
Hi Francis, have no direct clue on how to solve the algo without holding the nodes in memory in order to track progress. Not a nice one. Any algo expert around here to have a better solution? Cheers, /peter neubauer COO and Sales, Neo Technology GTalk: neubauer.peter Skype peter.neub

Re: [Neo] Shut down the NeoClipse

2010-03-29 Thread Anders Nawroth
Hi! Amir: One major drawback of Neoclipse is that you can't disconnect from a database. Hope to fix it in a while. Rick: It should give up after a few attempts. However, this should be solved when we add connect/disconnect functionality, as it won't connect at all during the startup then. /a

Re: [Neo] Using subreference nodes

2010-03-29 Thread Anders Nawroth
Hi! If you only need one entry point to the graph, it's fine to use the reference node for this purpose. And BTW, you can of course create subreference nodes yourself, it's just a node and a relationship, but the util used in the blog entry makes it easier to do it in a nice way. /anders Am

Re: [Neo] previous relations doesn't overwrite

2010-03-29 Thread Peter Neubauer
Yes Amir, Neo4j is not constraining you in any way in creating your relationships, so you can have any number of relationships, even of the same type, between the same nodes. You will have to check that, or force some structure on the nodespace via a meta, see http://components.neo4j.org/neo4j-meta