May 22, 2013

MySQL 5.5 and MySQL 5.6 default variable values differences

February 21, 2013 By 8 Comments

As the part of analyzing surprising MySQL 5.5 vs MySQL 5.6 performance results I’ve been looking at changes to default variable values. To do that I’ve loaded the values from MySQL 5.5.30 and MySQL 5.6.10 to the different tables and ran the query:

Lets go over to see what are the most important changes [...]

Filed Under: Insight for DBAs, MySQL Tagged With: , , ,

Quickly finding unused indexes (and estimating their size)

December 5, 2012 By 2 Comments

I had a customer recently who needed to reduce their database size on disk quickly without a lot of messy schema redesign and application recoding.  They didn’t want to drop any actual data, and their index usage was fairly high, so we decided to look for unused indexes that could be removed. Collecting data It’s [...]

Filed Under: Insight for DBAs, MySQL, Percona Software

MySQL Indexing Best Practices: Webinar Questions Followup

August 16, 2012 By 4 Comments

I had a lot of questions on my MySQL Indexing: Best Practices Webinar (both recording and slides are available now) We had lots of questions. I did not have time to answer some and others are better answered in writing anyway. Q: One developer on our team wants to replace longish (25-30) indexed varchars with [...]

Filed Under: Insight for DBAs, MySQL

Identifying the load with the help of pt-query-digest and Percona Server

December 29, 2011 By 3 Comments

Overview Profiling, analyzing and then fixing queries is likely the most oft-repeated part of a job of a DBA and one that keeps evolving, as new features are added to the application new queries pop up that need to be analyzed and fixed. And there are not too many tools out there that can make [...]

Filed Under: Insight for DBAs, MySQL

Shard-Query turbo charges Infobright community edition (ICE)

May 6, 2011 By 23 Comments

Shard-Query is an open source tool kit which helps improve the performance of queries against a MySQL database by distributing the work over multiple machines and/or multiple cores. This is similar to the divide and conquer approach that Hive takes in combination with Hadoop. Shard-Query applies a clever approach to parallelism which allows it to [...]

Filed Under: MySQL

Moving Subtrees in Closure Table Hierarchies

February 14, 2011 By 18 Comments

Many software developers find they need to store hierarchical data, such as threaded comments, personnel org charts, or nested bill-of-materials. Sometimes it’s tricky to do this in SQL and still run efficient queries against the data. I’ll be presenting a webinar for Percona on February 28 at 9am PST. I’ll describe several solutions for storing [...]

Filed Under: Insight for Developers, MySQL

When the subselect runs faster

March 18, 2010 By 9 Comments

A few weeks ago, we had a query optimization request from one of our customer. The query was very simple like:

This column in the table is looks like this:

The table have 549252 rows and of course, there is an index on the col1. MySQL estimated the cardinality of that index as [...]

Filed Under: Insight for Developers, MySQL Tagged With: , , , , ,

Multi Column indexes vs Index Merge

September 19, 2009 By 31 Comments

The mistake I commonly see among MySQL users is how indexes are created. Quite commonly people just index individual columns as they are referenced in where clause thinking this is the optimal indexing strategy. For example if I would have something like AGE=18 AND STATE=’CA’ they would create 2 separate indexes on AGE and STATE [...]

Filed Under: Insight for DBAs, MySQL Tagged With:

3 ways MySQL uses indexes

September 12, 2009 By 28 Comments

I often see people confuse different ways MySQL can use indexing, getting wrong ideas on what query performance they should expect. There are 3 main ways how MySQL can use the indexes for query execution, which are not mutually exclusive, in fact some queries will use indexes for all 3 purposes listed here.

Filed Under: Insight for Developers Tagged With:

Multiple column index vs multiple indexes

August 22, 2008 By 13 Comments

After my previous post there were questions raised about Index Merge on Multiple Indexes vs Two Column Index efficiency. I mentioned in most cases when query can use both of the ways using multiple column index would be faster but I also went ahead to do some benchmarks today.

Filed Under: Benchmarks, Insight for DBAs
« Older Posts