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). As a quick example, let’s look at the following statement:
update foo set price=price+1 where product=toy;
Executing this statement has two steps:
-
- a query to find where product=toy
- a combination of insertions and deletions to change old rows
to new rows
The analysis is identical to that for deletions. Just like for …
[Read more]