Data structures which require a disk seek per random insert are obsolete. LevelD... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

leif on July 28, 2011 | parent | context | favorite | on: LevelDB: A Fast Persistent Key-Value Store

Data structures which require a disk seek per random insert are obsolete. LevelDB is using a Log-Structured Merge Tree, one of many write-optimized data structures (but not the best).

DanWaterworth on July 28, 2011 [–]

This link, comparing LSM trees with fractal trees, is quite interesting: http://www.quora.com/What-are-the-major-differences-between-...

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact