Buy Percona ServicesBuy Now!

TokuDB speeds up “replace” and “insert ignore” operations by relaxing the affected rows constraint

 | August 3, 2010 |  Posted In: Tokutek, TokuView

In posts on June 30 and July 6, we explained how implementing the commands “replace into” and “insert ignore” with TokuDB’s fractal trees data structures can be two orders of magnitude faster than implementing them with B-trees. Towards the end of each post, we hinted at that there are some caveats that complicate the story […]

Read More

MariaDB and the MySQL Sandbox

 | July 26, 2010 |  Posted In: Tokutek, TokuView

Tokutek tests its TokuDB Fractal Tree storage engine with multiple MySQL distributions. We make extensive use of the MySQL Sandbox in our test automation. We tweaked the regular expressions that match binary tarball names in the MySQL Sandbox so that MariaDB releases can be easily loaded by the MySQL Sandbox. These changes can be found […]

Read More

Announcing TokuDB v4.0

 | July 3, 2010 |  Posted In: Tokutek, TokuView

Tokutek is pleased to announce immediate availability of TokuDB for MySQL, version 4.0. It is designed for continuous querying and analysis of large volumes of rapidly arriving and changing data, while maintaining full ACID properties. New in TokuDB v4.0 is our multi-threaded Fast Loader. Capable of utilizing all available CPU cores, the Fast Loader greatly […]

Read More

Making Updates Fast, by Avoiding Disk Seeks

 | June 22, 2010 |  Posted In: Tokutek, TokuView

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:

Executing this statement has […]

Read More

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

 | June 18, 2010 |  Posted In: Tokutek, TokuView

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 disk seeks. While they’re at it, they piggyback some other work on the disk seeks. […]

Read More