Subject: Re: [boost] Interest in B-tree library for Boost?
From: Cory Nelson (phrosty_at_[hidden])
Date: 2010-09-16 07:21:51
2010/9/16 Ion GaztaÃ±aga <igaztanaga_at_[hidden]>:
> El 16/09/2010 3:08, Beman Dawes escribiÃ³:
>>> - Can this be adapted for in-memory use as well, with full non-POD
>> 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.
> "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"
Correct me if I'm wrong, but it looks like a T-tree is just a plain
binary tree where the data is referenced with pointers and not stored
in the tree -- so it's designed to be memory-efficient when the key is
larger than a pointer and is already stored elsewhere. Useful for
databases that want low-overhead (in terms of key size, not tree
implementation) indexes into tables.
If that's the case, then it is not applicable here.
-- Cory Nelson http://int64.org
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk