We've been doing an easy Gig per minute using the batch updater.

All the best
Neil Ellis

(Sent from my iPhone)


On 16 Jun 2009, at 15:50, Dennis Peterson <[email protected]>  
wrote:

> Hi everybody, I just came across Neo4J, and while the read performance
> sounds great, I haven't seen anything about write performance. I
> suspect it's good, but wanted to ask.
>
> I'm considering using Neo for a threaded discussion forum. It
> definitely sounds like it would retrieve a discussion tree very
> quickly. Would it also be fast in posting new messages?
>
> Root comments would be attached to a topic, so by starting at the
> topic's node you can get a list of the latest posts. It seems the way
> to do this would essentially be to make a linked list of posts, and
> with each new one, splice the new node in between the topic node and
> the previous head of the list. Would there likely be undue contention
> at that point?
>
> I'll also be rating comments, and would like to get a list of
> highest-rated comments. For that, I would likely keep a list of them.
> Keep the current low score somewhere, refresh it periodically with a
> scan of the list, anything above the low score just add it to the
> list, and periodically purge the excess.
>
> In a relational database of course it's easy, just sort by the
> scores...but that score index is going to be constantly re-sorting
> itself, so there's plenty going on, you just don't see it. I suspect
> Neo would actually be more performant since you don't have to keep
> *all* the comments sorted by score.
>
> Am I on the right track?
> _______________________________________________
> Neo mailing list
> [email protected]
> https://lists.neo4j.org/mailman/listinfo/user
_______________________________________________
Neo mailing list
[email protected]
https://lists.neo4j.org/mailman/listinfo/user

Reply via email to