So nice! “let’s forget about caching for a minute”, huh :)
Максим Зиналь

Btree is inherently inefficient data structure when it comes to random writes, no matter how much caching you do. The data in btree is sorted on a primary key, and updates are done in place which causes random writes. Column stores or LSMs don’t do update in place, so they are more efficient in terms of writing to disk.

One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.