3 ms·
I would have thought the biggest performance boost would have come for databases based on B-tree-like structures on large datasets. You have to read to read an
by Nate75Sanders 16y ago
I would have thought the biggest performance boost would have come for databases based on B-tree-like structures on large datasets.
You have to read to read and read to write. Every depth of the tree that doesn't fit into main memory costs you a random read, whether to read or write.
- jbellis 16y agoWrite amplification (http://en.wikipedia.org/wiki/Write_amplification http://en.wikipedia.org/wiki/Write_amplification) means that naive random writes like what you see from b-trees are going to degrade performance on SSDs too (although not as pathologically as doing rotational seeks). In other words it still pays to be smart about i/o patterns.