Announcing TokuDB 2.1.0

Published on 06 August 2009 by Martin Farach-Colton in TokuView

Tokutek® announces the release the release of the TokuDB storage engine for MySQL®, version 2.1.0. This release offers the following improvements over our previous release: Faster indexing of sequential keys. Faster bulk loads on tables with auto-increment fields. Faster range queries in some circumstances. Added support for InnoDB. Upgraded from MySQL 5.1.30 to 5.1.36. Fixed [...]

2 comments | Continue Reading

The Depth of a B-tree

Published on 28 April 2009 by Martin Farach-Colton in TokuView

Schlomi Noach recently wrote a useful primer on the depth of B-trees and how that plays out for point queries — in both clustered indexes, like InnoDB, and in unclustered indexes, like MyISAM. Here, I’d like to talk about the effect of B-tree depth on insertions and range queries. And, of course, I’ll talk about [...]

0 comments | Continue Reading

Recall that I’ve claimed that it takes 28 years to fill a disk with random insertions, given a set of reasonable assumptions. Recall what they are: We are focusing on the storage engine (a la MySQL) level, and we are looking at a database on a single disk — the one we are using for [...]

1 comment | Continue Reading

I’ve been waving my hands about lower bounds. Well, sometimes I haven’t been waving my hands, because the lower bounds are tight. But in other cases (lenient insertions, range queries), the lower bounds are very far from what we’re used to. So now, for a bit of math: Brodal and Fagerberg showed in 2003 that [...]

0 comments | Continue Reading

Sorry for the delay, now on to range queries and lenient updates. Let’s call them queries and updates, for short. So far, I’ve shown that B-trees (and any of a number of other data structures) are very far from the “tight bound.” I’ll say a bound is a tight if it’s a lower bound and [...]

0 comments | Continue Reading

How Fast Can Updates Run?

Published on 11 February 2008 by Martin Farach-Colton in TokuView

Last time, I introduced the notion of strict and lenient updates. Now it’s time to see what the performance characteristics are of each. Just to rehash, we are focusing on the storage engine (a la MySQL) level, and we are looking at a database on a single disk — the one we are using for [...]

0 comments | Continue Reading

Updates & Discipline

Published on 05 February 2008 by Martin Farach-Colton in TokuView

So far, I’ve analyzed point and range queries. Now it’s time to talk about insertions and deletions. We’ll call the combination updates. Updates come in two flavors, and today we’ll cover both. Depending on the exact settings of your database, the updates give a varying amount of feedback. For example, when a key is deleted, [...]

0 comments | Continue Reading

Last time I talked about point queries. The conclusion was that big databases and point queries don’t mix. It’s ok to do them from time to time, but it’s not how you’re going to use your database, unless you have a lot of time. Today, I’d like to talk about range queries, which seem much [...]

0 comments | Continue Reading