by Martin.FarachColton | Aug 15, 2010 | MySQL
Tokutek is pleased to announce immediate availability of TokuDB for MySQL, version 4.1. 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.1 includes...
by Zardosht.Kasheff | Aug 11, 2010 | MySQL
In posts on June 30 and July 6, I 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, I hinted...
by Rich.Prohaska | Aug 3, 2010 | MySQL
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...
by Rich.Prohaska | Jul 26, 2010 | MySQL
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...
by Zardosht.Kasheff | Jul 21, 2010 | MySQL
In posts on June 30 and July 6, I 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...
by Zardosht.Kasheff | Jul 14, 2010 | MySQL
In my post on June 18th, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. I previously explained why it would be better to use “replace into” or to use...
by Zardosht.Kasheff | Jul 6, 2010 | MySQL
In my post from three weeks ago, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. Towards the end of the post, I claimed that it would be better to use “replace into” or...
by Justin Swanhart | Jul 5, 2010 | Insight for Developers, MySQL
I very much like the fact that MySQL allows you to embed comments into SQL statements. These comments are extremely convenient, because they are written into MySQL log files as part of the query. This includes the general log, the binary log and the slow query log....
by John.Partridge | Jul 3, 2010 | MySQL
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...
by Zardosht.Kasheff | Jun 30, 2010 | MySQL
In this post two weeks ago, I explained why the semantics of normal ad-hoc insertions with a primary key are expensive because they require disk seeks on large data sets. Towards the end of the post, I claimed that it would be better to use “replace into”...
by Zardosht.Kasheff | Jun 22, 2010 | MySQL
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...
by Zardosht.Kasheff | Jun 18, 2010 | MySQL
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....
by Zardosht.Kasheff | Jun 8, 2010 | MySQL
In my last post, I discussed how fractal tree data structures can be up to two orders of magnitude faster on deletions over B-trees. I focused on the deletions where the row entry is known (the storage engine API handler::delete_row), but I did not fully analyze how...
by Zardosht.Kasheff | Jun 2, 2010 | MySQL
As mentioned in parts 1 and 2, having many disk seeks are bad (they slow down performance). Fractal tree data structures minimize disk seeks on ad-hoc insertions, whereas B-trees practically guarantee that disk seeks are performed on ad-hoc insertions. As a result,...
by Zardosht.Kasheff | May 25, 2010 | MySQL
In part 1, I discussed why having many disk seeks are bad (they slow down performance), and how fractal tree data structures minimize disk seeks on ad-hoc insertions, whereas B-trees practically guarantee that disk seeks are performed on ad-hoc insertions. As a...
by kuszmaul | May 18, 2010 | MySQL
OpenSQL Camp Boston 2010 will be held at the Stata Center in Cambridge, Massachusetts, October 15-17, 2010. The Stata Center was designed by Frank Gehry and was completed in 2005. The Stata Center houses CSAIL (The MIT Computer Science and Artifical Intelligence...
by Maciej Dobrzanski | May 17, 2010 | Insight for Developers, MySQL
The problem I am going to describe is likely to be around since the very beginning of MySQL, however unless you carefully analyse and profile your queries, it might easily go unnoticed. I used it as one of the examples in our talk given at phpDay.it conference last...
by kuszmaul | May 11, 2010 | MySQL
I just spotted the youtube video of my OpenSQL Camp (Portland 2009) talk on An Open Storage Engine API. I talked about some of technical issues for implementing storage engines across many SQL front ends, not just MySQL. You can find this talk and other mostly...
by kuszmaul | May 4, 2010 | MySQL
Here are the slides and video for my MySQL UC ignite talk on measuring the performance of SSDs. You can find this talk and other mostly technical material here. This research was funded in part by the National Science Foundation.
by kuszmaul | Apr 30, 2010 | MySQL
I recently discovered that there’s a youtube video of the talk I gave at OpenSQL Camp in Portland in 2009. This is a whiteboard presentation and is less well developed than the talk I gave a the MySQL conference (I posted those slides two days ago. But since it...
