Y
Hacker News
new
|
ask
|
show
|
jobs
by
colanderman
1622 days ago
LSMs and fractal trees handle random inserts much better. But you still lose locality of lookups: items generated near each other time-wise are not correlated on disk.