Author Archives: zardosht

Making “Insert Ignore” Fast, by...

Posted on by zardosht

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 post,…

2 Comments

Making “Replace Into” Fast, by...

Posted on by zardosht

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, I…

7 Comments

Making Updates Fast, by Avoiding Disk Seeks

Posted on by zardosht

The analysis that shows how to make deletions really fast by using clustering keys and TokuDB’s fractal tree based engine also applies to make updates really fast. (I left it out of the…

Leave a comment

Disk seeks are evil, so let’s avoid them, pt. 4

Posted on by zardosht

Continuing in the theme from previous posts, I’d like to examine another case where we can eliminate all disk seeks from a MySQL operation and therefore get two orders-of-magnitude speedup. The general outline of these posts is:

B-trees do…

2 Comments

Making Deletions Fast, by Avoiding Disk Seeks

Posted on by zardosht

In my last post, I discussed how fractal tree data structures can be up to two orders of magnitude faster on deletions over B-trees. I focused on the deletions where the row entry is known (the storage engine…

2 Comments

Disk seeks are evil, so let’s avoid them, pt. 3...

Posted on by zardosht

As mentioned in parts 1 and 2, having many disk seeks are bad (they slow down performance). Fractal tree data structures minimize disk seeks on ad-hoc insertions, whereas B-trees practically guarantee that disk seeks are performed on…

1 Comment

Disk seeks are evil, so let’s avoid them,...

Posted on by zardosht

In part 1, I discussed why having many disk seeks are bad (they slow down performance), and how fractal tree data structures minimize disk seeks on ad-hoc insertions, whereas B-trees practically guarantee that disk seeks are performed on…

1 Comment

Disk Seeks are Evil, so Let’s Avoid Them,...

Posted on by zardosht

Disk seeks are expensive. Typically, a disk can perform no more than a few hundred seeks per second. So, any database operation that induces a disk seek is going to be slow, perhaps unacceptably slow. Adding disks can sometimes help…

4 Comments

TokuDB Indexes are NOT in-memory (and not hash...

Posted on by zardosht

Another plug for Bradley’s talk Thursday morning at the MySQL User’s conference. Spending the day talking to DBA’s and other potential users of TokuDB, I (Zardosht) noticed the same question/theme come up numerous times in conversation. “Oh, so your indexes…

Leave a comment

New TokuDB 2.2.0 feature: more query progress...

Posted on by zardosht

Last spring, we added a feature that allows the user to see the progress of writes in a statement. Vadim liked it. In 2.2.0, in “show processlist”, we add progress information on reads.

Here is an example of…

Leave a comment