24 Oct
2006
24 Oct
'06
4:47 p.m.
Yes, Btree as in http://en.wikipedia.org/wiki/B-tree I think a Btree would be a nice addition to Boost. I am looking for a generic B-tree that I can use to store any C++ object, with variable length key and data fields On 10/24/06, Joe Drumm <joe.drumm@gmail.com> wrote:
I think he is talking about BTrees, as in http://en.wikipedia.org/wiki/B-tree, and not normal binary trees. These are used for example by RDBMS engines for index storage. They are self-balancing in that each node can contain a variable number of keys between a given range. Nodes split when they become "too full" (likewise they merge when sufficient space is available through removal of keys).
Joe