Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
charlieyu1
on Dec 24, 2023
|
parent
|
context
|
favorite
| on:
How does a B-tree make queries fast?
Is there any other data structures that benefits from hardware?
prydt
on Dec 24, 2023
|
next
[–]
LSM trees are a good example of a data structure optimized for memory hardware (both hdds and ssds).
omginternets
on Dec 24, 2023
|
prev
[–]
Arrays come to mind.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: