News for hackers. Stuff that matters.
Re:Crit-bit Trees: the best way to store sets by jbapple on Wednesday September 21, 2011 @02:35AM (#3021030)
The string b-tree also does trie-like search without sacrificing balance:

http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.59...

There are no comments on this comment yet.