Category Archives: TokuView

Posts to the TokuView Blog

Making “Replace Into” Fast, by...

Posted on by Zardosht Kasheff

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 claimed that it

7 Comments

Making Updates Fast, by Avoiding Disk Seeks

Posted on by Zardosht Kasheff

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 last post to keep the story simple).

Leave a comment

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

Posted on by Zardosht Kasheff

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 insertion…

2 Comments

Making Deletions Fast, by Avoiding Disk Seeks

Posted on by Zardosht Kasheff

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 API

2 Comments

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

Posted on by Zardosht Kasheff

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 ad-hoc insertions.

1 Comment