Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dfranke
on July 7, 2008
|
parent
|
context
|
favorite
| on:
B-Trees - Balanced Search Trees for Slow Storage
Hash tables can be used on disk as well.
Tamerlin
on July 7, 2008
[–]
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.
dfranke
on July 8, 2008
|
parent
[–]
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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: