<story><title>MariaDB 10.1 can do 1M queries per second</title><url>https://blog.mariadb.org/10-1-mio-qps/</url></story><parent_chain><item><author>swasheck</author><text>could you explain why the tokudb engine is an advantage?</text></item><item><author>bratao</author><text>MariaDB recently released the version 10.1 as GA. 
&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;blog.mariadb.org&amp;#x2F;mariadb-10-1-is-stable-ga&amp;#x2F;&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;blog.mariadb.org&amp;#x2F;mariadb-10-1-is-stable-ga&amp;#x2F;&lt;/a&gt;&lt;p&gt;We been using it for a large dataset, and has been fantastic. Compared to MySQL 5.7 and PostgreSQL, it have the advantage of supporting the TokuDB engine out of box. My data uncompressed is 3TB, with it , we can fit in 300GB with all indexes.
Read Free Replication with TokuDB (&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;percona&amp;#x2F;tokudb-engine&amp;#x2F;wiki&amp;#x2F;Read-Free-Replication-with-TokuDB&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;percona&amp;#x2F;tokudb-engine&amp;#x2F;wiki&amp;#x2F;Read-Free-Repl...&lt;/a&gt;) also enable us to have a very cheap VPS as slave.</text></item></parent_chain><comment><author>bratao</author><text>TokuDB is a very modern engine that uses a data-structure called &amp;quot;Fractal Trees&amp;quot;. Imagine something like a B-Tree with buffers in the non-leaf nodes. It also heavily compress the row data.&lt;p&gt;The main point of TokuDB is not writing everything to the disk thanks to the buffers, and with the very efficient compression, more data fits in the memory and saves the space for big-data applications. ( please someone correct me if I´m wrong)&lt;p&gt;In our tests TokuDB was vital for our startup. With it, we can use cheap dedicated servers and our performance is amazing. We tried PostgreSQL, MongoDB 3.0 and MySQL 5.7 and they can´t fit our data in a 2TB disk or were slow in our tests.</text></comment>
<story><title>MariaDB 10.1 can do 1M queries per second</title><url>https://blog.mariadb.org/10-1-mio-qps/</url></story><parent_chain><item><author>swasheck</author><text>could you explain why the tokudb engine is an advantage?</text></item><item><author>bratao</author><text>MariaDB recently released the version 10.1 as GA. 
&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;blog.mariadb.org&amp;#x2F;mariadb-10-1-is-stable-ga&amp;#x2F;&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;blog.mariadb.org&amp;#x2F;mariadb-10-1-is-stable-ga&amp;#x2F;&lt;/a&gt;&lt;p&gt;We been using it for a large dataset, and has been fantastic. Compared to MySQL 5.7 and PostgreSQL, it have the advantage of supporting the TokuDB engine out of box. My data uncompressed is 3TB, with it , we can fit in 300GB with all indexes.
Read Free Replication with TokuDB (&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;percona&amp;#x2F;tokudb-engine&amp;#x2F;wiki&amp;#x2F;Read-Free-Replication-with-TokuDB&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;github.com&amp;#x2F;percona&amp;#x2F;tokudb-engine&amp;#x2F;wiki&amp;#x2F;Read-Free-Repl...&lt;/a&gt;) also enable us to have a very cheap VPS as slave.</text></item></parent_chain><comment><author>acomjean</author><text>Tokutek and some staff where common vititors to the boston mysql meetup.  If I remember they were using &amp;quot;fractal trees&amp;quot; instead of b-trees.  Trading cpu cycles for disk io.  It was interesting tech.&lt;p&gt;&lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;highscalability.com&amp;#x2F;blog&amp;#x2F;2014&amp;#x2F;8&amp;#x2F;6&amp;#x2F;tokutek-white-paper-a-comparison-of-log-structured-merge-lsm.html&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;highscalability.com&amp;#x2F;blog&amp;#x2F;2014&amp;#x2F;8&amp;#x2F;6&amp;#x2F;tokutek-white-paper...&lt;/a&gt;&lt;p&gt;Quote:&amp;quot;The idea behind FT(fractal Trees) indexes is to maintain a B tree in which each internal node of the tree contains a buffer. When a data record is inserted into the tree, instead of traversing the entire tree the way a B tree would, we simply insert the Eventually the root buffer will fill up with new data records. At that point the FT index copies the inserted records down a level of the tree. Eventually the newly inserted records will reach the leaves, at which point they are simply stored in a leaf node as a B tree would store them. The data records descending through the buffers of the tree can be thought of as messages that say “insert this record”. FT indexes can use other kinds of messages, such as messages that delete a record, or messages that update a record.&amp;quot;&lt;p&gt;some other links:&lt;p&gt;&lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;web.archive.org&amp;#x2F;web&amp;#x2F;20150414215556&amp;#x2F;http:&amp;#x2F;&amp;#x2F;www.tokutek.com&amp;#x2F;2010&amp;#x2F;06&amp;#x2F;making-replace-into-fast-by-avoiding-disk-seeks&amp;#x2F;&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;web.archive.org&amp;#x2F;web&amp;#x2F;20150414215556&amp;#x2F;http:&amp;#x2F;&amp;#x2F;www.tokutek...&lt;/a&gt;&lt;p&gt;&lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;assets.en.oreilly.com&amp;#x2F;1&amp;#x2F;event&amp;#x2F;36&amp;#x2F;How%20TokuDB%20Fractal%20Tree%20Databases%20Work%20Presentation.pdf&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;assets.en.oreilly.com&amp;#x2F;1&amp;#x2F;event&amp;#x2F;36&amp;#x2F;How%20TokuDB%20Fract...&lt;/a&gt;</text></comment>