Yearly Archives: 2008

iiBench configuration

Posted on by bradley

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:

3 Comments

iiBench Contest

Posted on by bradley

I’d like to advertise my previous iiBench posting again (now that we are feeding into PlanetMySQL.)

Leave a comment

iiBench Contest – Who Can Insert 1B Rows...

Posted on by bradley

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…

8 Comments

Hacking for Faster Insertions: Is this really how...

Posted on by Martin Farach-Colton

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…

2 Comments

Tradeoff: Insertions versus Point Queries

Posted on by Martin Farach-Colton

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…

Leave a comment

Tradeoffs: Updates versus Range Queries

Posted on by Martin Farach-Colton

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…

Leave a comment

How Fast Can Updates Run?

Posted on by Martin Farach-Colton

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…

Leave a comment

Updates & Discipline

Posted on by Martin Farach-Colton

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

Leave a comment

Range Queries: Is the Bottleneck Seeks or...

Posted on by Martin Farach-Colton

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…

Leave a comment

The Trouble with Point Queries

Posted on by admin

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

Leave a comment