News for hackers. Stuff that matters.
Re:Building data structures that are smaller than an array a... by gorset on Thursday March 01, 2012 @06:43AM (#3651738)
My solution is to use a fixed tree with bloated leaf nodes (use more bits per element in the leaf node). A high number of nodes with a low number of elements causes a high overhead, so I simply rebuild the tree at a few given thresholds to keep the overhad and the cost of the bloated leaf nodes down. We can discuss further by email, if you want. I'd love to read your paper! :-)

There are no comments on this comment yet.