New TokuDB v5.2
TokuDB® v5.2 is a drop-in replacement for InnoDB that scales MySQL® from GBs to TBs while improving insert speed, query performance, compression, and online schema flexibility. Uses standard SQL and supports ACID and MVCC.
-
“Fractal tree indexing looks like the future. #tokudb #mysql”
—Tweeted by @phils_butt Archive
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- January 2009
- December 2008
- April 2008
- March 2008
- February 2008
- January 2008
Yearly Archives: 2008
A tip of the hat to Mark Callaghan, who suggested I post our my.cnf settings for iiBench.
Instead of fiddling around with the configuration file, we adjusted everything on the command line. Here’s the relevant script from iiBench/scripts/start_mysql.sh:
I’d like to advertise my previous iiBench posting again (now that we are feeding into PlanetMySQL.)
At the recent OpenSQL Camp in Charlottesville, VA, Tokutek offered a challenge to the MySQL community – who can insert a billion rows into MySQL the fastest? We will post the results on our website and the winner gets a…
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…
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…
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…
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…
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,…
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…
Insertion and Queries
Databases are complicated beasts, but I’d like to focus on the storage engine, just the part that talks to the storage system, and doesn’t have to worry about SQL, etc.: just transactions, concurrency, compression, updates and queries.…

