Apr 13, 2012 |
MySQL
This week, I was at Percona Live, and it was a lot of fun! I even got to give a talk on write optimization techniques (not just ours), that I’m told will be online soon. But if you missed that, or even if you didn’t, I’m still in the valley until Monday night. I’ll be […]
Oct 04, 2011 |
MySQL
In my last post, we talked about the read/write tradeoff of indexing data structures, and some ways that people augment B-trees in order to get better write performance. We also talked about the significant drawbacks of each method, and I promised to show some more fundamental approaches. We had two “workload-based” techniques: inserting in sequential […]
Sep 22, 2011 |
MySQL
Some indexing structures are write optimized in that they are better than B-trees at ingesting data. Other indexing structures are read optimized in that they are better than B-trees at query time. Even within B-trees, there is a tradeoff between write performance and read performance. For example, non-clustering B-trees (such as MyISAM) are typically faster […]