couchdb-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paul Davis <paul.joseph.da...@gmail.com>
Subject Re: Fundamentals Question on CoucheDB's append only b+tree.
Date Wed, 14 Mar 2012 04:37:39 GMT
On Tue, Mar 13, 2012 at 11:33 PM, Randall Leeds <randall.leeds@gmail.com> wrote:
> On Mar 13, 2012 7:11 PM, "Paul Davis" <paul.joseph.davis@gmail.com> wrote:
>>
>> On Tue, Mar 13, 2012 at 5:50 PM, Bob Dionne
>> <dionne@dionne-associates.com> wrote:
>> > That's largely correct, though couchdb's btree is neither fish nor fowl.
>> >
>> > It doesn't have an order (B-trees generally do) and it does store
> values in the inner nodes (B+trees do not)
>> >
>>
>> The lack of order is the big thing.
>
> What is meant by order in this context?

Maximum number of elements in a node. Ie, the whole "every node except
the root must have between N/2 and N elements at all times" thing.

Mime
View raw message