Making “Replace Into” Fast, by Avoiding Disk Seeks
In this post two weeks ago, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. Towards the end of the post,...
View ArticleMaking “Insert Ignore” Fast, by Avoiding Disk Seeks
In my post from three weeks ago, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. Towards the end of the...
View ArticleWhy “insert … on duplicate key update” May Be Slow, by Incurring Disk Seeks
In my post on June 18th, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. I previously explained why it...
View ArticleClik here to view.
MySQL Partitioning: A Flow Chart
In Part 1, and Part 2 of this series, I presented some thoughts on partitioning. I heard some great feedback on why people use partitioning. Here, I present a flow chart that summarizes what I’ve...
View ArticleClik here to view.
Database Insights from Archimedes to the Houston Rockets
Archimedes, the first DBA According to a recent MIT Sloan Management Review study, top performing organizations use analytics 5 times more than lower performers. That’s pretty astounding. And while we...
View ArticleClik here to view.
1 Billion Insertions – The Wait is Over!
iiBench measures the rate at which a database can insert new rows while maintaining several secondary indexes. We ran this for 1 billion rows with TokuDB and InnoDB starting last week, right after we...
View Article
