[ZODB-Dev] Re: ZODB Benchmarks

[David Binger]

On Nov 2, 2007, at 10:18 AM, Christian Theune wrote:

> Wouldn't a queue be a good data structure to do that? IIRC ZC already
> wrote a queue that doesn't conflict:
>
> http://svn.zope.de/zope.org/zc.queue/trunk/src/zc/queue/queue.txt
>
> If you store key/value pairs in the queue, you can do a step-by-step
> migration from the queue to the btree.

I guess that was the original proposal mentioned by Matt.

The bad thing about a Queue for this purpose is that searches are  
linear time,
so you can't wait as long before consolidating.  That might be okay,  
though, if you
intend to run consolidations continuously.

>
> Probably this should be encapsulated into a new data structure that
> looks btree-like and has an additional `consolidate` method.

That sounds proper.