![]() |
Boost : |
Subject: Re: [boost] Interest in B-tree library for Boost?
From: Ion Gaztañaga (igaztanaga_at_[hidden])
Date: 2010-09-16 06:50:16
El 16/09/2010 3:08, Beman Dawes escribió:
>> - Can this be adapted for in-memory use as well, with full non-POD support?
>
> No current plans for that. Why wouldn't you just a standard library
> associative container for that?
I think it's about performance/node overhead (less rebalances, you
allocate arrays and not individual nodes). But for memory, T-Trees are
the way to go. They are used by many in-memory DBs.
http://en.wikipedia.org/wiki/T-tree
"In computer science a T-tree is a type of binary tree data structure
that is used by main-memory databases, such as Datablitz, eXtremeDB,
MySQL Cluster, Oracle TimesTen and KairosMobileLite"
Best,
Ion
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk