Advanced MySQL Query Tuning | Web & PHP Magazine



CREATE TABLE City (
    ID int(11) NOT NULL AUTO_INCREMENT,
    Name char(35) NOT NULL DEFAULT '',
    CountryCode char(3) NOT NULL DEFAULT '',
    District char(20) NOT NULL DEFAULT '',
    Population int(11) NOT NULL DEFAULT '0',
    PRIMARY KEY (ID),
    KEY CountryCode (CountryCode)
) Engine=InnoDB;

EXPLAIN select * from City where Name = 'London'\G
alter table City add key (Name);
Index usages
MySQL will choose only 1 index per query (and per table if the query joins multiple tables). In some cases MySQL can also intersect indexes. MySQL uses index statistics to make a decision about the best possible index.
Combined Indexes
Combined indexes are very important for MySQL query optimizations. MySQL can use leftmost part of any index. For example, if we have this index:

Comb(CountryCode, District, Population)
Then MySQL can use:

CountryCode only part
CountryCode + District
CountryCode + District + Population
However, if the query does not have the first leftmost part of an index, MySQL will not be able to use it:
mysql> explain select * from City where
District = 'California' and population > 10000\G
Covered index
The covered index is an index that covers all fields in the query 
Extra: Using where; Using index
“Using index” in the extra field of the explain output means that MySQL will use our covered index. That also means that MySQL will use an index only to satisfy the query: all the information that MySQL needs is in the index. That is usually much faster, especially if we have a large text or blob fields in the table.
Order of the fields in index
The order of the fields in the index is very important. The way b-tree works, it is more beneficial to have a field which will be used for “equality” comparison first and the fields with “range” (more than and less than comparison) second.
Explain select max(DepDelayMinutes), carrier, dayofweek from ontime_2012  where dayofweek = 7 group by carrier
MySQL does not use any indexes (no proper indexes are available), but it also shows “Using temporary; Using filesort”. MySQL will need to create a temporary table to satisfy the “Group by” clause if there is no appropriate index.
alter table ontime_2012 add key covered(dayofweek, Carrier, DepDelayMinutes);
Explain select max(DepDelayMinutes), carrier, dayofweek from ontime_2012 where dayofweek = 7 group by carrier
As we can see from the explain, MySQL will use our index and will avoid creating a temporary table. This is the fastest possible solution. 
ORDER BY and filesort
MySQL may have to perform a “filesort” operation when a query uses the “order by” clause.
To optimize this query we can use a combined index:
alter table City add key my_sort2 (CountryCode, population);
explain select district, name, population from City where CountryCode = 'USA' order by population desc limit 10\G

MySQL was able to use our combined index to avoid sorting: as the index is sorted, MySQL was able to read the index leafs in the correct order.

Using “ORDER BY” + limit optimization can help optimize your queries.
  • Covered index is a great MySQL feature and, in most cases, can increase MySQL performance significantly.
  • Some queries may also be optimized with a separate index which will enable loose index scan algorithm.
  • Order by optimizations can be done with covered index and with the “order by+limit” index technique, described above.
Read full article from Advanced MySQL Query Tuning | Web & PHP Magazine

No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts