Re: B-Trees - Balanced Search Trees for Slow Storage
by dfranke on Monday July 07, 2008 @08:54PM
(#239395)
B-trees are basically the only sane option if you ever need to do range queries. Hash tables tend to outperform them a bit on all other operations.
[ Parent
| on HN ]
There are no comments on this comment yet.