Re: [Neo4j] GraphAlgoFactory.pathsWithLength returns paths with loops
2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Thanks Mattias! Do you have an expected time-frame for that? Alternatively, do you have any quick tips on how I would go and implement this myself? I very briefly scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect I should test whether a node has already been visited (in goOneStep() perhaps?). Would you say that's the right approach? Thanks again, Unfortunately it's hard to estimate when there's time to do it. Your suggestion sounds reasonable, but keep in mind that the algo is used for the shortest path calculation as well. So an extra argument in the constructor for ignoring loopy paths when finding paths of a certain length would be the way to go IMO. --- Yaniv On Sun, Oct 17, 2010 at 10:18 PM, Mattias Persson matt...@neotechnology.com wrote: I just realized (it was me who put it there) that the documentation is wrong. That one allows cyclic paths, as you obviously noticed :). I'll try to add a simplePathsWithLength method also to take care of that... 2010/10/17 Yaniv Ben Yosef yani...@gmail.com Sure :) Will be happy to get your feedback. --- Yaniv On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Yaniv, thanks for the report, I will take a look at it tomorrow if that is ok? Cheers, /peter neubauer VP Product Management, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 1:28 PM, Yaniv Ben Yosef yani...@gmail.com wrote: Hi, I am playing with Neo4J version 1.2 M1, specifically with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should never return paths with loops. However, it seems like it does. I created a simple test case to demonstrate that: http://snipt.org/kpwn/ I expect the code not to show any path, but instead it prints the following path: Path: A - B - C - B Please let me know if there's any fault on my side, or if that's a bug. Thanks, Yaniv ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] GraphAlgoFactory.pathsWithLength returns paths with loops
Thanks, I figured that.. Would you be so kind reviewing the code once I finish it? --- Yaniv On Mon, Oct 18, 2010 at 8:20 AM, Mattias Persson matt...@neotechnology.comwrote: 2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Thanks Mattias! Do you have an expected time-frame for that? Alternatively, do you have any quick tips on how I would go and implement this myself? I very briefly scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect I should test whether a node has already been visited (in goOneStep() perhaps?). Would you say that's the right approach? Thanks again, Unfortunately it's hard to estimate when there's time to do it. Your suggestion sounds reasonable, but keep in mind that the algo is used for the shortest path calculation as well. So an extra argument in the constructor for ignoring loopy paths when finding paths of a certain length would be the way to go IMO. --- Yaniv On Sun, Oct 17, 2010 at 10:18 PM, Mattias Persson matt...@neotechnology.com wrote: I just realized (it was me who put it there) that the documentation is wrong. That one allows cyclic paths, as you obviously noticed :). I'll try to add a simplePathsWithLength method also to take care of that... 2010/10/17 Yaniv Ben Yosef yani...@gmail.com Sure :) Will be happy to get your feedback. --- Yaniv On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Yaniv, thanks for the report, I will take a look at it tomorrow if that is ok? Cheers, /peter neubauer VP Product Management, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 1:28 PM, Yaniv Ben Yosef yani...@gmail.com wrote: Hi, I am playing with Neo4J version 1.2 M1, specifically with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should never return paths with loops. However, it seems like it does. I created a simple test case to demonstrate that: http://snipt.org/kpwn/ I expect the code not to show any path, but instead it prints the following path: Path: A - B - C - B Please let me know if there's any fault on my side, or if that's a bug. Thanks, Yaniv ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] GraphAlgoFactory.pathsWithLength returns paths with loops
2010/10/18 Yaniv Ben Yosef yani...@gmail.com Thanks, I figured that.. Would you be so kind reviewing the code once I finish it? Sure! --- Yaniv On Mon, Oct 18, 2010 at 8:20 AM, Mattias Persson matt...@neotechnology.comwrote: 2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Thanks Mattias! Do you have an expected time-frame for that? Alternatively, do you have any quick tips on how I would go and implement this myself? I very briefly scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect I should test whether a node has already been visited (in goOneStep() perhaps?). Would you say that's the right approach? Thanks again, Unfortunately it's hard to estimate when there's time to do it. Your suggestion sounds reasonable, but keep in mind that the algo is used for the shortest path calculation as well. So an extra argument in the constructor for ignoring loopy paths when finding paths of a certain length would be the way to go IMO. --- Yaniv On Sun, Oct 17, 2010 at 10:18 PM, Mattias Persson matt...@neotechnology.com wrote: I just realized (it was me who put it there) that the documentation is wrong. That one allows cyclic paths, as you obviously noticed :). I'll try to add a simplePathsWithLength method also to take care of that... 2010/10/17 Yaniv Ben Yosef yani...@gmail.com Sure :) Will be happy to get your feedback. --- Yaniv On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Yaniv, thanks for the report, I will take a look at it tomorrow if that is ok? Cheers, /peter neubauer VP Product Management, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 1:28 PM, Yaniv Ben Yosef yani...@gmail.com wrote: Hi, I am playing with Neo4J version 1.2 M1, specifically with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should never return paths with loops. However, it seems like it does. I created a simple test case to demonstrate that: http://snipt.org/kpwn/ I expect the code not to show any path, but instead it prints the following path: Path: A - B - C - B Please let me know if there's any fault on my side, or if that's a bug. Thanks, Yaniv ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Roadmap detail feedback?
The long-term roadmap looks good. Don't have an opinion either way about the format of the short-term road map or how much detail it should contain. I somehow doubt anyone aside from the currently active developers will get much out of the short-term details. Just my $0.02. -- Message: 1 Date: Fri, 15 Oct 2010 14:50:19 +0200 From: Peter Neubauer peter.neuba...@neotechnology.com Subject: [Neo4j] Roadmap detail feedback? To: Neo4j user discussions user@lists.neo4j.org Message-ID: aanlktinzmy1n=tgaorb92ruohkgrbq2r4lgfxqbac...@mail.gmail.com Content-Type: text/plain; charset=ISO-8859-1 Hi folks, the Neo4j team is busy working on Neo4j 1.2. Doing so, a lot of communication is happening between the developers and not so much on the mailing list. However, I am going to keep a short-term (per milestone) and long-term (high level) roadmap updated over at http://wiki.neo4j.org/content/Roadmap I would love to get some feedback on what level of details you all would like to get. Should issues (e.g. from trac) and user stories that are worked on be included in the short term roadmap, and would you like to see some other format than the Wiki? I feel it would be of much value to all to get a better view of what is happening. WDYAT? Cheers, /peter neubauer VP Product Development, Neo Technology 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? ? ? ? ? ? ?? - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. -- ___ User mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user End of User Digest, Vol 43, Issue 18 -- MIKAMAI | Making Media Social http://mikamai.com +447868260229 ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] GraphAlgoFactory.pathsWithLength returns paths with loops
Hi Mattias, While taking a closer look at the code, I realized there's an AllSimplePaths class, which can be easily modified to filter paths whose length isn't maxDepth (with an extra argument or subclass). I think that's the simplest solution, but I'm not clear on why pathsWithLength() uses ShortestPath rather than AllPaths.. Is there an efficiency gain here that I don't see? And a newbie question: I checked out the algo component (via the 0.7-1.2.M01 tag). I have no trouble building it, but Maven doesn't create a JAR package of it (the target directory only has classes). Is there a different pom.xml I should use (I used the one in the root of the component directory)? I gather it has to be automated somewhere. Thanks! --- Yaniv On Mon, Oct 18, 2010 at 11:27 AM, Mattias Persson matt...@neotechnology.com wrote: 2010/10/18 Yaniv Ben Yosef yani...@gmail.com Thanks, I figured that.. Would you be so kind reviewing the code once I finish it? Sure! --- Yaniv On Mon, Oct 18, 2010 at 8:20 AM, Mattias Persson matt...@neotechnology.comwrote: 2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Thanks Mattias! Do you have an expected time-frame for that? Alternatively, do you have any quick tips on how I would go and implement this myself? I very briefly scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect I should test whether a node has already been visited (in goOneStep() perhaps?). Would you say that's the right approach? Thanks again, Unfortunately it's hard to estimate when there's time to do it. Your suggestion sounds reasonable, but keep in mind that the algo is used for the shortest path calculation as well. So an extra argument in the constructor for ignoring loopy paths when finding paths of a certain length would be the way to go IMO. --- Yaniv On Sun, Oct 17, 2010 at 10:18 PM, Mattias Persson matt...@neotechnology.com wrote: I just realized (it was me who put it there) that the documentation is wrong. That one allows cyclic paths, as you obviously noticed :). I'll try to add a simplePathsWithLength method also to take care of that... 2010/10/17 Yaniv Ben Yosef yani...@gmail.com Sure :) Will be happy to get your feedback. --- Yaniv On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Yaniv, thanks for the report, I will take a look at it tomorrow if that is ok? Cheers, /peter neubauer VP Product Management, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 1:28 PM, Yaniv Ben Yosef yani...@gmail.com wrote: Hi, I am playing with Neo4J version 1.2 M1, specifically with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should never return paths with loops. However, it seems like it does. I created a simple test case to demonstrate that: http://snipt.org/kpwn/ I expect the code not to show any path, but instead it prints the following path: Path: A - B - C - B Please let me know if there's any fault on my side, or if that's a bug. Thanks, Yaniv ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] GraphAlgoFactory.pathsWithLength returns paths with loops
Hi Yaniv, To build the jar file, be sure to run `mvn clean package` which will run through clean, compile, test, then package. Or, `mvn clean install` to have the jar files installed in your local maven repository. Best, Andreas On Oct 18, 2010, at 5:15 PM, Yaniv Ben Yosef wrote: Hi Mattias, While taking a closer look at the code, I realized there's an AllSimplePaths class, which can be easily modified to filter paths whose length isn't maxDepth (with an extra argument or subclass). I think that's the simplest solution, but I'm not clear on why pathsWithLength() uses ShortestPath rather than AllPaths.. Is there an efficiency gain here that I don't see? And a newbie question: I checked out the algo component (via the 0.7-1.2.M01 tag). I have no trouble building it, but Maven doesn't create a JAR package of it (the target directory only has classes). Is there a different pom.xml I should use (I used the one in the root of the component directory)? I gather it has to be automated somewhere. Thanks! --- Yaniv On Mon, Oct 18, 2010 at 11:27 AM, Mattias Persson matt...@neotechnology.com wrote: 2010/10/18 Yaniv Ben Yosef yani...@gmail.com Thanks, I figured that.. Would you be so kind reviewing the code once I finish it? Sure! --- Yaniv On Mon, Oct 18, 2010 at 8:20 AM, Mattias Persson matt...@neotechnology.comwrote: 2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Thanks Mattias! Do you have an expected time-frame for that? Alternatively, do you have any quick tips on how I would go and implement this myself? I very briefly scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect I should test whether a node has already been visited (in goOneStep() perhaps?). Would you say that's the right approach? Thanks again, Unfortunately it's hard to estimate when there's time to do it. Your suggestion sounds reasonable, but keep in mind that the algo is used for the shortest path calculation as well. So an extra argument in the constructor for ignoring loopy paths when finding paths of a certain length would be the way to go IMO. --- Yaniv On Sun, Oct 17, 2010 at 10:18 PM, Mattias Persson matt...@neotechnology.com wrote: I just realized (it was me who put it there) that the documentation is wrong. That one allows cyclic paths, as you obviously noticed :). I'll try to add a simplePathsWithLength method also to take care of that... 2010/10/17 Yaniv Ben Yosef yani...@gmail.com Sure :) Will be happy to get your feedback. --- Yaniv On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Yaniv, thanks for the report, I will take a look at it tomorrow if that is ok? Cheers, /peter neubauer VP Product Management, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 1:28 PM, Yaniv Ben Yosef yani...@gmail.com wrote: Hi, I am playing with Neo4J version 1.2 M1, specifically with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should never return paths with loops. However, it seems like it does. I created a simple test case to demonstrate that: http://snipt.org/kpwn/ I expect the code not to show any path, but instead it prints the following path: Path: A - B - C - B Please let me know if there's any fault on my side, or if that's a bug. Thanks, Yaniv ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com]
Re: [Neo4j] neo4j.py
Tanmoy, do you see any stacktrace other than this? Are you using the python bindings from SVN? I remember that there was a similar issue a while back, see http://www.listware.net/201009/neo4j-user/66442-neo4j-importerror-no-applicable-backend-found-with-revision-5676.html Cheers, /peter neubauer VP Product Development, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 11:48 AM, Tanmoy mukherjee.tan...@gmail.com wrote: Hi I have some issues installing neo4j. As far as the import statement is concerned it seems to work fine. However the error comes when i do this. graphdb=GraphDatabase(/home/tanmoy/Desktop) Traceback (most recent call last): File stdin, line 1, in module File /usr/lib/python2.5/site-packages/Neo4j.py-0.1_SNAPSHOT-py2.5.egg/neo4j/__init__.py, line 517, in __new__ neo = core.load_neo(resource_uri, params) File /usr/lib/python2.5/site-packages/Neo4j.py-0.1_SNAPSHOT-py2.5.egg/neo4j/_core.py, line 180, in load_neo backend.initialize(**parameters) File /usr/lib/python2.5/site-packages/Neo4j.py-0.1_SNAPSHOT-py2.5.egg/neo4j/_backend/__init__.py, line 61, in initialize raise ImportError(No applicable backend found.) ImportError: No applicable backend found. Could anyone help me with this. Been trying to use Jython 2.5.2 -- Tanmoy Mukherjee ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] GraphAlgoFactory.pathsWithLength returns paths with loops
2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Hi Mattias, While taking a closer look at the code, I realized there's an AllSimplePaths class, which can be easily modified to filter paths whose length isn't maxDepth (with an extra argument or subclass). I think that's the simplest solution, but I'm not clear on why pathsWithLength() uses ShortestPath rather than AllPaths.. Is there an efficiency gain here that I don't see? Currently the AllSimplePaths traverses in one direction only, whereas ShortestPath traverser from both directions (start and end node) interleaved, making it more efficient. Filtering paths from AllSimplePaths will do the trick, but patching ShortestPath will give better performance! And a newbie question: I checked out the algo component (via the 0.7-1.2.M01 tag). I have no trouble building it, but Maven doesn't create a JAR package of it (the target directory only has classes). Is there a different pom.xml I should use (I used the one in the root of the component directory)? I gather it has to be automated somewhere. Thanks! --- Yaniv On Mon, Oct 18, 2010 at 11:27 AM, Mattias Persson matt...@neotechnology.com wrote: 2010/10/18 Yaniv Ben Yosef yani...@gmail.com Thanks, I figured that.. Would you be so kind reviewing the code once I finish it? Sure! --- Yaniv On Mon, Oct 18, 2010 at 8:20 AM, Mattias Persson matt...@neotechnology.comwrote: 2010/10/18, Yaniv Ben Yosef yani...@gmail.com: Thanks Mattias! Do you have an expected time-frame for that? Alternatively, do you have any quick tips on how I would go and implement this myself? I very briefly scanned the code in org.neo4j.graphalgo.impl.path.ShortestPath and I suspect I should test whether a node has already been visited (in goOneStep() perhaps?). Would you say that's the right approach? Thanks again, Unfortunately it's hard to estimate when there's time to do it. Your suggestion sounds reasonable, but keep in mind that the algo is used for the shortest path calculation as well. So an extra argument in the constructor for ignoring loopy paths when finding paths of a certain length would be the way to go IMO. --- Yaniv On Sun, Oct 17, 2010 at 10:18 PM, Mattias Persson matt...@neotechnology.com wrote: I just realized (it was me who put it there) that the documentation is wrong. That one allows cyclic paths, as you obviously noticed :). I'll try to add a simplePathsWithLength method also to take care of that... 2010/10/17 Yaniv Ben Yosef yani...@gmail.com Sure :) Will be happy to get your feedback. --- Yaniv On Sun, Oct 17, 2010 at 6:24 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Yaniv, thanks for the report, I will take a look at it tomorrow if that is ok? Cheers, /peter neubauer VP Product Management, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Sun, Oct 17, 2010 at 1:28 PM, Yaniv Ben Yosef yani...@gmail.com wrote: Hi, I am playing with Neo4J version 1.2 M1, specifically with GraphAlgoFactory.pathsWithLength(). According to the javadoc, it should never return paths with loops. However, it seems like it does. I created a simple test case to demonstrate that: http://snipt.org/kpwn/ I expect the code not to show any path, but instead it prints the following path: Path: A - B - C - B Please let me know if there's any fault on my side, or if that's a bug. Thanks, Yaniv ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list
Re: [Neo4j] Architecturing neo4j for scalability
Victor, for scaling out, there are two approaches that we see people using to scale Neo4j: 1. Use HA to replicate several Neo4j instances High Availability as a Master-Slave scenario with Master failover is currently in QA, but is planned to be released as part of Neo4j 1.2 and merged into the main component stream as of yesterday. So, the next milestone release 1.2.M02 (hopefully released on Thursday) has this built in, see http://wiki.neo4j.org/content/High_Availability_Cluster which will be fleshed out. This should enable you to scale reads transparently for your client code, since all slaves are writable. 2. Build an Event bus feeding multiple instances In order to have all data on all replicated Neo4j instances, you could for instance use a messaging system like RabbitMQ to feed all updates to all instances. This might have advantages for some scenarios, but mostly I would suggest to test 1. first. Does that help? Let the community know what issues you are experiencing in setting up Neo4j HA, would be great to get some feedback from you! Cheers, /peter neubauer VP Product Development, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Thu, Oct 7, 2010 at 9:54 PM, Victor Augusto de Campos piv...@gmail.com wrote: Sorry Peter for the late reply (and the clumsy first email). I drew a very very simple diagram exemplifying the architecture, I don't know if the list will support the attachment so if it doesn't, warn me :P As you can see by the diagram, my neo4j DB is running inside the REST app that will read and write from the DB and also perform. The Reader is an application which reads out a queue, checks relationships of an user making some action and send some messages based on those relationships. The website is indeed a back-end application which the real website is based on. My question was: when I need to scale the REST app (because of the huge load that the mentioned website will generate) what should I do with the neo4j embedded in it? Thanks for your attention again. On Mon, Oct 4, 2010 at 10:17 AM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Victor, sorry, I am not entirely understanding your domain so I can't say anything for sure. Do you have some architectural diagram and/or some example flow in order to better understand? Sorry for the inconvenience Cheers, /peter neubauer VP Product Development, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Tue, Sep 28, 2010 at 4:47 AM, Victor Augusto de Campos piv...@gmail.com wrote: Hey folks, I'm actually developing an application that requires maintaining following relationships between nodes, another application reads out those relationships and take the steps to perform notifications about actions to some entities. That said, I got a doubt about the best design to maintain all things going well. As I've benchmarked neo4j alone can easily handle the reading/writing load but as I'm running it as a embedded database into the application who also provides a RESTful API to let other applications notify about actions I'm afraid that when I need to scale out this application I'll have troubles scaling neo4j embedded in it. So, what would be the best approach? Decouple neo4j from that application and let it run as a separate app (or use neo4j-rest, although I haven't looked into its API and don't know if it provides a official client, but well) or if it would be simple to scale out neo4j DB with the application providing that RESTful API. I don't know if I exposed my question clear, any doubts I'll be glad to answer ^^ Best regards, Victor Augusto de Campos ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] An attempt at documenting the internals and architecture of Neo
Chris, great reading your blogs on this! Did you get on with the transaction piece yet? In case you need info, don't hesitate to ask here on the list, there are a number of folks that have disected the area before :) Also, when it comes to Neo4j working with other TX managers in a JTA environment like JOTM and Atomikos, I hope we will be able at least to start with failing tests in these environments in the next iteration and beginning with that, start working around the issues that JTA is leaving for non-relational stores like Neo4j. There might be some details that you are interested in when digging there :) Cheers, /peter neubauer On Mon, Oct 11, 2010 at 12:16 AM, Chris Gioran chris.gio...@gmail.com wrote: Hi list, I have another couple of posts on the same series. The first can be read at http://digitalstain.blogspot.com/2010/10/neo4j-internals-file-storage.html and it is an exposition of my understanding of the format of the files that neo keeps its data in. It is a fairly big post that deals with small details, so should anyone read it do not be surprised if it proves to be reality incompatible. Corrections will be incorporated ASAP. The second is about the next level in the persistence subsystem of neo and is here: http://digitalstain.blogspot.com/2010/10/neo4j-internals-persistence-and-memory.html I try to explain how the buckets of bits are translated to entities in the domain of neo, how the memory mapping works and I dwell for a bit over the light vs heavy issue. Note that both posts where written in one stretch each after I finished going through the code. I expect that at some points I may have left out details that are not so clear for someone going through the implementation for the first time. If you note something like that (or any other errors, of course) please comment so that I can remedy them. Hopefully within the week I will have a piece about the transaction handling and how that interfaces with the store and the NodeManager. But to get there I have some reading to do. cheers, CG ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] More PHP and REST goodness on the way
Hi folks, it seems on the PHP front things are moving, since http://github.com/VoltVoodoo/Neo4j.php (forked from http://github.com/onewheelgood/Neo4J-REST-PHP-API-client) got updated by Jake and Olle to support more features from the REST-API. Would be great if some could give it a try and report/fix issues so it gets more stable and can deliver input to the REST work that is scheduled to start in some weeks time. Any feedback is welcome, as always! Cheers, /peter ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Architecturing neo4j for scalability
Peter, Thank you very much for the info, it helped a lot. I entirely agree with HA being a much better approach to scale out Neo4j and I'll see to implement it ASAP to give you some feedback. Currently the project is entering staging mode and as I do some benchmarks I'll see when to use HA and how it perform out. Thanks again for all, and just as a quick feedback, I'm pleased to read the support given by you from Neo Technology in this mailing list (and actually it's the only one that I keep in my inbox :P) Best regards! On Mon, Oct 18, 2010 at 6:44 PM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Victor, for scaling out, there are two approaches that we see people using to scale Neo4j: 1. Use HA to replicate several Neo4j instances High Availability as a Master-Slave scenario with Master failover is currently in QA, but is planned to be released as part of Neo4j 1.2 and merged into the main component stream as of yesterday. So, the next milestone release 1.2.M02 (hopefully released on Thursday) has this built in, see http://wiki.neo4j.org/content/High_Availability_Cluster which will be fleshed out. This should enable you to scale reads transparently for your client code, since all slaves are writable. 2. Build an Event bus feeding multiple instances In order to have all data on all replicated Neo4j instances, you could for instance use a messaging system like RabbitMQ to feed all updates to all instances. This might have advantages for some scenarios, but mostly I would suggest to test 1. first. Does that help? Let the community know what issues you are experiencing in setting up Neo4j HA, would be great to get some feedback from you! Cheers, /peter neubauer VP Product Development, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Thu, Oct 7, 2010 at 9:54 PM, Victor Augusto de Campos piv...@gmail.com wrote: Sorry Peter for the late reply (and the clumsy first email). I drew a very very simple diagram exemplifying the architecture, I don't know if the list will support the attachment so if it doesn't, warn me :P As you can see by the diagram, my neo4j DB is running inside the REST app that will read and write from the DB and also perform. The Reader is an application which reads out a queue, checks relationships of an user making some action and send some messages based on those relationships. The website is indeed a back-end application which the real website is based on. My question was: when I need to scale the REST app (because of the huge load that the mentioned website will generate) what should I do with the neo4j embedded in it? Thanks for your attention again. On Mon, Oct 4, 2010 at 10:17 AM, Peter Neubauer peter.neuba...@neotechnology.com wrote: Victor, sorry, I am not entirely understanding your domain so I can't say anything for sure. Do you have some architectural diagram and/or some example flow in order to better understand? Sorry for the inconvenience Cheers, /peter neubauer VP Product Development, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Tue, Sep 28, 2010 at 4:47 AM, Victor Augusto de Campos piv...@gmail.com wrote: Hey folks, I'm actually developing an application that requires maintaining following relationships between nodes, another application reads out those relationships and take the steps to perform notifications about actions to some entities. That said, I got a doubt about the best design to maintain all things going well. As I've benchmarked neo4j alone can easily handle the reading/writing load but as I'm running it as a embedded database into the application who also provides a RESTful API to let other applications notify about actions I'm afraid that when I need to scale out this application I'll have troubles scaling neo4j embedded in it. So, what would be the best approach? Decouple neo4j from that application and let it run as a separate app (or use neo4j-rest, although I haven't looked into its API and don't know if it provides a official client, but well) or if it would be simple to scale out neo4j DB with the application providing that RESTful API. I don't know if I exposed my question clear, any doubts I'll be glad to answer ^^ Best regards,
Re: [Neo4j] Roadmap detail feedback?
Thanks Todd, I thought that there are different sources of features and stories, like the community, Trac, the Neo Technology customers, the QA process, load-performance tests and crashing tests (currently 10 EC2 instances crashing away at the latest trunk :) and others that have input to what people are working on. It's hard to reflect all that in a consistent manner, so one might just highlight the most important features, and then of course start linking to solved issues in the different issue trackers (GIThub for the webadmin, Trac for most components etc). Thanks for the feedback! Cheers, /peter neubauer VP Product Development, Neo Technology 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 - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Mon, Oct 18, 2010 at 4:01 PM, Todd Chaffee t...@mikamai.com wrote: The long-term roadmap looks good. Don't have an opinion either way about the format of the short-term road map or how much detail it should contain. I somehow doubt anyone aside from the currently active developers will get much out of the short-term details. Just my $0.02. -- Message: 1 Date: Fri, 15 Oct 2010 14:50:19 +0200 From: Peter Neubauer peter.neuba...@neotechnology.com Subject: [Neo4j] Roadmap detail feedback? To: Neo4j user discussions user@lists.neo4j.org Message-ID: aanlktinzmy1n=tgaorb92ruohkgrbq2r4lgfxqbac...@mail.gmail.com Content-Type: text/plain; charset=ISO-8859-1 Hi folks, the Neo4j team is busy working on Neo4j 1.2. Doing so, a lot of communication is happening between the developers and not so much on the mailing list. However, I am going to keep a short-term (per milestone) and long-term (high level) roadmap updated over at http://wiki.neo4j.org/content/Roadmap I would love to get some feedback on what level of details you all would like to get. Should issues (e.g. from trac) and user stories that are worked on be included in the short term roadmap, and would you like to see some other format than the Wiki? I feel it would be of much value to all to get a better view of what is happening. WDYAT? Cheers, /peter neubauer VP Product Development, Neo Technology 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? ? ? ? ? ? ?? - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. -- ___ User mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user End of User Digest, Vol 43, Issue 18 -- MIKAMAI | Making Media Social http://mikamai.com +447868260229 ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] License Question Running Neo4j (AGPL) in Eclipse (EPL)
Hi Peter, are there some news? On 07.10.2010 12:50, Peter Neubauer wrote: Hi there, let me get back to you on that in a few days, need to talk to some more educated sources on that in order to to say anything incorrect. ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
