News for hackers. Stuff that matters.

A comment on An LSM-Tree-based Ultra-Large Key-Value Store for Small Data [pdf].

Re:An LSM-Tree-based Ultra-Large Key-Value Store for Small D... by kragen on Monday May 02, 2016 @11:15AM (#11612028)
I haven't read the whole paper, but "LSM" is "log-structured merge"; I guess they merge runs over time to keep write amplification down? As eyan points out, Twigg's (Acunu's) "stratified B-trees" may have obsoleted the whole copy-on-write-B-tree family of data structures.
[ Parent | on HN ]
Re:An LSM-Tree-based Ultra-Large Key-Value Store for Small D... by jorangreef on Monday May 02, 2016 @11:44AM (#11612395)
This is a form of LSM tree which sacrifices range queries to gain at most 5x write amplification over 5 levels. That translates into a significant increase in throughput compared to LevelDB and RocksDB.
[ Parent | on HN ]