Yearly Archives: 2010

On “Replace Into”, “Insert...

Posted on by zardosht

In posts on June 30 and July 6, I explained how implementing the commands “replace into” and “insert ignore” with TokuDB’s fractal trees data structures can be two orders of magnitude faster than…

Leave a comment

Why “insert … on duplicate key...

Posted on by zardosht

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 would be better

6 Comments

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

Announcing TokuDB v4.0

Posted on by John Partridge

Tokutek is pleased to announce immediate availability of TokuDB for MySQL, version 4.0. It is designed for continuous querying and analysis of large volumes of rapidly arriving and changing data, while maintaining full ACID properties.
New in TokuDB v4.0…

Leave a comment

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