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 On 10/24/06, Christian Henning <chhenning@gmail.com> wrote:
What do you mean by disk one?
On 10/24/06, Jose <jmalv04@gmail.com> wrote:
On 10/24/06, Christian Henning <chhenning@gmail.com> wrote:
OK, yesterday the request for quad and oct trees. Today, binary trees. ;-)
The SOC project is for a memory container not a disk one _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost