Stephan,
what's the size of your db? if it's under 10G, how about just dump the
full directory into to a ramfs. leave 1G to jvm and it'll do heavy io
on the ramfs. i think it's a simple solution and could yield
interesting result. please let me know the result if you tried. thanks

On Tue, Sep 20, 2011 at 5:41 PM, Peter Neubauer
<peter.neuba...@neotechnology.com> wrote:
> Steven,
> the index is built into the DB, so you can use something like
> http://docs.neo4j.org/chunked/snapshot/tutorials-java-embedded-index.html
> to index all your nodes into Lucene (in one index, the node as key,
> the number of relationships as numeric value when creating them). When
> reading, you would simply request all keys from the index and iterate
> over them. I am not terribly sure how much fast it is, but given that
> you are just loading up documents, Lucene should be reasonably fast.
>
> Let us know if that works out!
>
> 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               - Your high performance graph database.
> http://startupbootcamp.org/    - Öresund - Innovation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Tue, Sep 20, 2011 at 6:01 PM, st3ven <st3...@web.de> wrote:
>> Hello Peter,
>>
>> it's a pity that neo4j doesn't support full graph-scans.
>>
>> Is there maybe a possibility to cache more relationships to speed things up
>> a little bit.
>> I recognized that only the iteration over the relationships is taking hours.
>> The time to get all relationships of one node is quite fast.
>>
>> I think I could try your second solution:
>> - Store the relationships as a property in an Index (e.g. Lucene) and
>> as the index for all entries. Thus, you are using an index for what it
>> is good at - global operations over all documents.
>>
>> But I didn't understood it correctly. Do you mean an Index which stores the
>> ID of a relationship and creating such an Index for every node?
>> Could you maybe give me a code example for that?
>> That would be very kind of you.
>>
>> The first solution is not really realizable, because I don't know the number
>> of relationships of every node.
>> I would have to count the relationships before the insertion and that would
>> make my database useless for the node degree query.
>>
>> Thank you very much for your help!
>>
>> Cheers,
>> Stephan
>>
>> --
>> View this message in context: 
>> http://neo4j-community-discussions.438527.n3.nabble.com/Creating-a-graph-database-with-BatchInserter-and-getting-the-node-degree-of-every-node-tp3351599p3352509.html
>> Sent from the Neo4j Community Discussions mailing list archive at Nabble.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
>



-- 
Best regards

Linan Wang
_______________________________________________
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user

Reply via email to