News for hackers. Stuff that matters.

A comment on B-Trees - Balanced Search Trees for Slow Storage. Parent comment

Re: B-Trees - Balanced Search Trees for Slow Storage by dfranke on Monday July 07, 2008 @03:45PM (#239100)
Hash tables can be used on disk as well.
[ Parent | on HN ]
Re: B-Trees - Balanced Search Trees for Slow Storage by Tamerlin on Monday July 07, 2008 @07:41PM (#239329)
That's certainly true. They're also useful for distributed caches, but that doesn't make B-trees any less useful when the situation calls for it.
[ Parent | on HN ]
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 ]