|
Boost : |
Subject: Re: [boost] Interest in B-tree library for Boost?
From: Stewart, Robert (Robert.Stewart_at_[hidden])
Date: 2010-09-16 07:19:27
Ion Gaztañaga wrote:
> 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"
In the same article, however, one reads:
"Although T-trees seem to be widely used for main-memory databases, recent research indicates that they actually do not perform better than B-trees on modern hardware."
Followed by links to research to justify the claim.
Then, again, there's the recent thread on Judy arrays to consider, too.
_____
Rob Stewart robert.stewart_at_[hidden]
Software Engineer, Core Software using std::disclaimer;
Susquehanna International Group, LLP http://www.sig.com
IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk