by Tokutek | Jun 1, 2011 | MySQL
In the 18th century, Benjamin Franklin stated “In this world nothing is certain but death and taxes.” In the 21st century this is still valid, but there is also an additional truism, especially in IT – the certainty of digital information growth. Even with a...
by Baron Schwartz | May 31, 2011 | MySQL
At Percona Live last week, someone showed me a graph from their Cacti monitoring system, using the templates that I wrote. It was the buffer pool pages read, written, and created. He asked me if the graph was okay. Shouldn’t there be a lot more pages read than...
by Martin.FarachColton | May 27, 2011 | MySQL
Yesterday, Percona held Percona Live NYC, which they describe as an “intensive one-day MySQL summit.” They meant it. It was like drinking from a firehose. There was too much for me to give a complete report, so I’d like to highlight two sessions that...
by Baron Schwartz | May 25, 2011 | MySQL
We’re seeing a spike of last-minute ticket sales for Percona Live New York. Meanwhile, we’re assembling bags and unpacking t-shirts at the venue. If you want to come, buy your ticket now — we’re rapidly selling out the remaining tickets!...
by Martin.FarachColton | May 24, 2011 | MySQL
OldSQL DBs based on B-trees have some well-known problems and workarounds. TokuDB is a NewSQL storage engines based on Fractal Tree indexing, so the natural question is how InnoDB practice translates into TokuDB. This post gives a quick overview. Enjoy! FAQ Q: How do...
by Baron Schwartz | May 23, 2011 | MySQL
Just a couple of announcements for Percona Live: we’re giving away free tickets through Engine Yard, and we’ve arranged our evening open-bar event. For a chance to win a free ticket, check out the guest blog post I wrote for Engine Yard on how to make...
by Peter Zaitsev | May 20, 2011 | MySQL
MySQL 5.5 and Percona Server 5.5 do not solve all scalability problems even for read only workloads. Workloads which got a lot of attention such as Sysbench and DBT2/TPC-C scale pretty well a they got a lot of attention, there can be other quite typical workloads...
by Vadim Tkachenko | May 20, 2011 | MySQL
InnoDB compression is getting some traction, and I see quite contradictory opinions. Someone has successful deployments in productions, and someone says that compression in current implementation is useless. To get some initial impression about performance I decided...
by Justin Swanhart | May 19, 2011 | MySQL
http://Flexvie.ws fully implements a method for creating materialized views for MySQL data sets. The tool is for MySQL, but the methods are database agnostic. A materialized view is an analogue of software transactional memory. You can think of this as database...
by Justin Swanhart | May 17, 2011 | MySQL
The most useful feature of the relational database is that it allows us to easily process data in sets, which can be much faster than processing it serially. When the relational database was first implemented, write-ahead-logging and other technologies did not exist....
by Tokutek | May 16, 2011 | MySQL
SoMoLo Data – Social, Mobile, and Local A Review of MassTLC’s “The Global Impact of Mobility” event this past Friday MassTLC celebrated World Enterprise Mobility Day on Friday by hosting an event near MIT on the “Global Impact of Mobility”. The event included...
by Vadim Tkachenko | May 16, 2011 | MySQL
Percona is pleased to welcome Stewart Smith to the team. Stewart does not need an extended introduction for MySQL Community, but just in case: Stewart has a long history with both the MySQL and Drizzle code bases. He’s been one of the core Drizzle developers since the...
by Justin Swanhart | May 16, 2011 | MySQL
Hi, Here is an easy way to run the subset sum check from SQL, which you can then distribute with Shard-Query: CREATE TABLE `the list` ( `id` bigint(20) NOT NULL AUTO_INCREMENT, `val` bigint(20) NOT NULL DEFAULT '0', PRIMARY KEY (`id`), KEY `id` (`id`) ) ENGINE=MyISAM;...
by Justin Swanhart | May 16, 2011 | MySQL
Often times, from a computing perspective, one must run a function on a large amount of input. Often times, the same function must be run on many pieces of input, and this is a very expensive process unless the work can be done in parallel. Shard-Query introduces set...
by Baron Schwartz | May 16, 2011 | MySQL
For a long time I’ve wanted to know how MySQL scales as you add more memory to the server. Vadim recently benchmarked the effects of increasing memory and CPU core count. He looked for a balance between utilizing the hardware as much as possible, limiting the...
by Baron Schwartz | May 15, 2011 | MySQL
I have one free ticket to give away to RailsConf next week in Baltimore! Post a comment to win, and if you aren’t the winner, I’ll give you a discount code for Percona Live as a consolation prize. Here’s the catch: you have to find at least one thing...
by Justin Swanhart | May 14, 2011 | MySQL
Demonstrating distributed set processing performance Shard-Query + ICE scales very well up to at least 20 nodes This post is a detailed performance analysis of what I’ve coined “distributed set processing”. Please also read this post’s “sister post” which describes...
by Justin Swanhart | May 14, 2011 | MySQL
Can Shard-Query scale to 20 nodes? Peter asked this question in comments to to my previous Shard-Query benchmark. Actually he asked if it could scale to 50, but testing 20 was all I could due to to EC2 and time limits. I think the results at 20 nodes are very useful...
by Aleksandr Kuzminsky | May 13, 2011 | MySQL
There are two ways InnoDB can organize tablespaces. First is when all data, indexes and system buffers are stored in a single tablespace. This is typicaly one or several ibdata files. A well known innodb_file_per_table option brings the second one. Tables and system...
by Martin.FarachColton | May 12, 2011 | MySQL
I’ve recently been blogging about how partitioning is a poor man’s answer to covering indexes. I got the following comment from Jaimie Sirovich: “There are many environments where you could end up creating N! indices to cover queries for queries...
