There are many angles you can look at the system to predict in performance, the model baron has published for example is good for measuring scalability of the system as concurrency growths. In many cases however we’re facing a need to answer a question how much load a given system can handle when load is [...]
Is it a good idea to deploy your database into the cloud? It depends. I have seen it work well many times, and cause trouble at other times. In this blog post I want to examine cloud-based I/O. I/O matters a lot when a) the database’s working set is bigger than the server’s memory, or [...]
It’s finally here! Percona Server Percona Server 5.5.8-20.0 is now available for download. This is a beta release of Percona’s enhancements to the MySQL 5.5.8 server. Here are some highlights: Performance and scalability improvements throughout the server and storage engine Optimizations for flash storage such as SSD, Virident, and FusionIO Optimizations for cloud computing The [...]
I’ve posted a new white paper about the implementation and benefits of Percona Server’s fast-restart capabilities. Briefly, after shutting down and restarting or rebooting the server, it can be back to full performance in a couple of minutes. That’s minutes, not hours or days. This matters a lot for keeping uptime high and reducing hardware [...]
Be careful with my findings, I appear to have compile in debug mode, I am redoing the benchmarks. Updated version here. I recently had to work with many customers having large number of connections opened in MySQL and although I told them this was not optimal, I had no solid arguments to present. More than [...]
When analyzing how good or bad response time is it is not handy to look at the averages, min or max times – something what is easily computed using built in aggregate functions. We most likely would like to see some percentile numbers – 95 percentile or 99 percentile. The problem is computing these in [...]
MySQL supports two different algorithms for views: the MERGE algorithm and the TEMPTABLE algorithm. These two algorithms differ greatly. A view which uses the MERGE algorithm can merge filter conditions into the view query itself. This has significant performance advantages over TEMPTABLE views. A view which uses the TEMPTABLE algorithm will have to compute the [...]
…any sessions this year; Peter, Vadim, and the rest of us at Percona submitted over a dozen session proposals, which were initially declined. As …Cabral is organizing.
That’s the back story — now on to the Percona Performance Conference! This is not “another MySQL conference.” It’s a performance…to Santa Clara.
We will not be the only ones speaking at Percona Performance Conference; other experts will join us in making presentations too. …to propose a session, please do so through the Percona Performance Conference website.
The Percona team looks forward to greeting you face to face …
How smart is the MySQL optimizer? If it sees an expression repeated many times, does it realize they’re all the same and not calculate the result for each of them? I had a specific case where I needed to find out for sure, so I made a little benchmark. The query looks something like this:
We have a lot of customers who do click analysis, site analytics, search engine marketing, online advertising, user behavior analysis, and many similar types of work.Â The first thing these have in common is that they’re generally some kind of loggable event. The next characteristic of a lot of these systems (real or planned) is [...]