May 25, 2012

Post: Multi Range Read (MRR) in MySQL 5.6 and MariaDB 5.5

results For the purpose of this benchmark, I have used TPC-H Queryquery runs the optimizer would switch to using plan ‘a’, which does not involve MRR, and the query time for MySQLquery time goes down from ~11min to under a minute. The query time is reduced further when buffer size is set large

Post: Join Optimizations in MySQL 5.6 and MariaDB 5.5

set to 6M and read_rnd_buffer_size set to 6M, the query time for MySQL 5.6 becomes approximately equal to that of MySQLquery #3, in fact disabling both of these provided the best result

Post: How FLUSH TABLES WITH READ LOCK works with Innodb Tables

Query | 0 | NULL | show processlist | 0 | 0 | 1 | +——-+——+———–+———-+————+——+——————————+——————————+———–+—————+———–+ 5 rows in set (0.00 sec) As result

Post: MySQL Query Cache

MySQL Performance optimization tasks but there are number of things you need to know. First let me clarify what MySQL QueryQuery Cache – meaning cache where execution plans are cached. MySQL Query Cache is not. It does not cache the plan but full result sets

Post: Working with large data sets in MySQL

What does working with large data sets in mySQL teach you ? Of course you have to learn a lot about query optimization, art of building summary tables and tricks of executing queries…… this however results in the challenge as results you’ve gotten for small data set may not apply to large data set so you need…

Post: MySQL: Followup on UNION for query optimization, Query profiling

queries to see what exactly happens during query execution – very helpful for MySQL Performance optimization: mysql> flush status; Query OK, 0 rows affected (0.00 sec) mysql

Post: Performance impact of complex queries

MySQL Performance by complex queries on large data sets(ie some large aggregate queries) and batch jobs. It is not rare to see queries…would try to optimize throughput before latency, meaning if you have query which is doing … snapshot of current database with same results. In some cases you can’t …

Post: ORDER BY ... LIMIT Performance Optimization

query log or by examining Hander statistics). If only 50 rows are examined to provide 10 rows of result setMySQL still will not be able to use it as Optimizer is not smart enough yet to detect such cases: mysql…However if you’re dealing with LIMIT query with large offset efficiency will suffer. LIMIT…

Post: How fast can you sort data with MySQL ?

MySQL can sort 1.000.000 rows, or rather return top 10 rows from sorted result setoptimal for given platform and given query (I did not test if it is the same for all platforms or data sets) – The optimal

Post: High-Performance Click Analysis with MySQL

… that nested-loop joins on large data sets are very expensive.  If MySQL supported sort-merge or hash joins…are not all that fast on big joins; the query optimizer can sometimes pick bad plans when you have … to it before I do!) you’ll see results on this blog. Another is Kickfire — also something …