MySQL的JOIN(五):JOIN优化实践之排序

这篇博文讲述如何优化JOIN查询带有排序的状况。大体分为对链接属性排序对非链接属性排序两种状况。插入测试数据。算法

CREATE TABLE t1 (
        id INT PRIMARY KEY AUTO_INCREMENT,
        type INT
    );
    SELECT COUNT(*) FROM t1;
    +----------+
    | COUNT(*) |
    +----------+
    |   10000  |
    +----------+
    CREATE TABLE t2 (
        id INT PRIMARY KEY AUTO_INCREMENT,
        type INT
    );
    SELECT COUNT(*) FROM t2;
    +----------+
    | COUNT(*) |
    +----------+
    |      100 |
    +----------+

 

对链接属性进行排序

现要求对t1和t2作内链接,链接条件是t1.id=t2.id,并对链接属性id属性进行排序(MySQL为主键id创建了索引)。测试

有两种选择,方式一[...ORDER BY t1.id],方式二[...ORDER BY t2.id],选哪一种呢?优化

首先咱们找出驱动表和被驱动表,按照小表驱动大表的原则,大表是t1,小表是t2,因此t2是驱动表,t1是非驱动表,t2驱动t1。而后进行分析,若是咱们使用方式一的话,MySQL会先对t1进行排序而后执行表链接算法,若是咱们使用方式二的话,只能执行表链接算法后对结果集进行排序(extra:using temporary),效率必然低下。spa

因此,当对链接属性进行排序时,应当选择驱动表的属性做为排序表中的条件。.net

-- 对被驱动表字段进行排序
    EXPLAIN SELECT * FROM t1 INNER JOIN t2 ON t1.id =t2.id ORDER BY t1.id;
    +----+-------+--------+---------+------+---------------------------------+
    | id | table | type   | key     | rows | Extra                           |
    +----+-------+--------+---------+------+---------------------------------+
    |  1 | t2    | ALL    | NULL    |  100 | Using temporary; Using filesort |
    |  1 | t1    | eq_ref | PRIMARY |    1 | NULL                            |
    +----+-------+--------+---------+------+---------------------------------+


    -- 对驱动表字段进行排序,没有Using temporary,也没有Using filesort 
    EXPLAIN SELECT * FROM t1 INNER JOIN t2 ON t1.id =t2.id ORDER BY t2.id;
    +----+-------+--------+---------+------+-------+
    | id | table | type   | key     | rows | Extra |
    +----+-------+--------+---------+------+-------+
    |  1 | t2    | index  | PRIMARY |  100 | NULL  |
    |  1 | t1    | eq_ref | PRIMARY |    1 | NULL  |
    +----+-------+--------+---------+------+-------+

 

对非链接属性进行排序

现要求对t1和t2作内链接,链接条件是t1.id=t2.id,并对非链接属性t1的type属性进行排序,[...ORDER BY t1.type]。blog

首先咱们找出驱动表和被驱动表,按照小表驱动大表的原则,大表是t1,小表是t2,因此MySQL Optimizer会用t2驱动t1。如今咱们要对t1的type属性进行排序,t1是被驱动表,必然致使对链接后结果集进行排序Using temporary(比Using filesort更严重)。因此,能不能不用MySQL Optimizer,用大表驱动小表呢? 
有请STRAIGHT_JOIN!排序

EXPLAIN SELECT * FROM t1 INNER JOIN t2 ON t1.id =t2.id ORDER BY t1.type;
    +----+-------+--------+---------+------+---------------------------------+
    | id | table | type   | key     | rows | Extra                           |
    +----+-------+--------+---------+------+---------------------------------+
    |  1 | t2    | ALL    | NULL    |  100 | Using temporary; Using filesort |
    |  1 | t1    | eq_ref | PRIMARY |    1 | NULL                            |
    +----+-------+--------+---------+------+---------------------------------+


    -- Using temporary没有了,可是大表驱动小表,致使内循环次数增长,实际开发中要从实际出发,
    -- 对此做出权衡。
    EXPLAIN SELECT * FROM t1 STRAIGHT_JOIN t2 ON t1.id =t2.id ORDER BY t1.type;
    +----+-------+--------+---------+-------+----------------+
    | id | table | type   | key     | rows  | Extra          |
    +----+-------+--------+---------+-------+----------------+
    |  1 | t1    | ALL    | NULL    | 10000 | Using filesort |
    |  1 | t2    | eq_ref | PRIMARY |     1 | NULL           |
    +----+-------+--------+---------+-------+----------------+

 

最后在MySQL的JOIN(一):用法那里挖了个坑,如今填上:INNER JOIN、JOIN、WHERE等值链接和STRAIGHT_JOIN都能表示内链接,那平时如何选择呢?通常状况下用INNER JOIN、JOIN或者WHERE等值链接,由于MySQL Optimizer会按照“小表驱动大表的策略”进行优化。当出现上述问题时,才考虑用STRAIGHT_JOIN索引

总结

《MySQL的JOIN》到此为止。开发

这系列博文讲述了JOIN的用法,JOIN的原理,以及在JOIN原理的基础上进行优化的手段。但愿对你们有帮助吧:)get

MySQL的JOIN(一):用法

MySQL的JOIN(二):JOIN原理

MySQL的JOIN(三):JOIN优化实践以内循环的次数

MySQL的JOIN(四):JOIN优化实践之快速匹配

MySQL的JOIN(五):JOIN优化实践之排序

相关文章
相关标签/搜索