couchdb-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Robert Newson <rnew...@apache.org>
Subject Re: Fundamentals Question on CoucheDB's append only b+tree.
Date Tue, 13 Mar 2012 21:27:34 GMT
what Randall said :P


On 13 March 2012 19:31, Randall Leeds <randall.leeds@gmail.com> wrote:
> On Tue, Mar 13, 2012 at 10:40, Robert Newson <rnewson@apache.org> wrote:
>
>> There's no linked list running between the leafs. A b+tree doesn't
>> require one, though it's a common addition. The b+tree algorithm is a
>> revision over a binary tree (where inner nodes point strictly at one
>> left and one right item). To be a b+tree you need to hold many
>> pointers on an inner node.
>>
>
> I thought being a B-tree was to have many pointers in inner nodes, being a
> B+tree was to have *only* pointers in inner nodes and the values all at the
> leaf nodes.
> Whatever it's called, the latter is what CouchDB has.

Mime
View raw message