Hi, Thanks for your answer. I have several more questions: 1. About the iterator - if I get a large amount of results (millions) it cannot be held in memory. Does the iterator work on in-memory collection, or there is something like JDBC fetch size? 2. Is there an example for what I'm looking for or can someone give pseudo code example for #3?
Thanks, Ori On Mon, Feb 7, 2011 at 6:04 PM, Jim Webber <j...@neotechnology.com> wrote: > Hi Ori, > > To answer your overall question: yes Neo4j is (generally speaking) a good > fit for this kind of exercise. > > To answer your specific questions: > > 1. The results you get back from the APIs are iterable, so you can "page" > through them at whatever pace you like. > 2. Since you're writing JVM code when you query your graph in Neo4j, you > can filter nodes that you want in your result set as part of your traversal > description. > 3. This is a harder algorithm (essentially a recommendation algorithm) but > again it is very compatible with Neo4j (we have customers doing similar > things in production). > > Don't hesitate to ask more questions on the list if you need more advice, > it's a very friendly community. > > Jim > _______________________________________________ > 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
