Re: Dictionary Implementation
Posted: Thu Mar 31, 2011 1:36 pm
Would there be a good way to make a compact radix tree, that is a similar structure to a radix tree that only uses, maybe, contiguous memory?
That's very easy, as long as you know which keys you need to insert beforehand and which keys are more likely to be looked up. Then you could optimise for almost perfect cache locality.xvedejas wrote:Would there be a good way to make a compact radix tree, that is a similar structure to a radix tree that only uses, maybe, contiguous memory?