SELECT * FROM `game`
WHERE (hometeam=29 OR awayteam=29)
AND `sportid`=1
AND`date` BETWEEN '2012-07-01' AND '2013-06-30'
AND deleted=0
Run Code Online (Sandbox Code Playgroud)
这个简单的查询需要 0.5-1.1 秒(没有缓存)。表孔 1.6M 行,所以我认为它应该快得多(<0.1 秒)。在下面的解释中,它显示它正在搜索表的一半。您可以看到我尝试了各种索引变体,但都没有运气,它总是想使用 Sportid 索引。
id | select_type | table | type | possible_keys | key | key_len | ref | rows | Extra
1 | SIMPLE | game | ref | date,hometeam,awayteam,sportid,deleted,sportid_2,sportid_3,sportid_4,sportid_5,sportid_6 | sportid | 1 | const | 800368 | Using where
Run Code Online (Sandbox Code Playgroud)
SHOW CREATE TABLE 游戏
CREATE TABLE `game` (
`gameid` int(11) unsigned NOT NULL AUTO_INCREMENT,
`sportid` tinyint(1) unsigned NOT NULL DEFAULT '1',
`hometeam` smallint(5) unsigned NOT NULL,
`awayteam` smallint(5) unsigned NOT NULL,
`homescore` tinyint(4) unsigned NOT NULL,
`awayscore` tinyint(4) unsigned NOT NULL,
`stadiumid` smallint(5) unsigned NOT NULL,
`neutral` tinyint(1) unsigned NOT NULL DEFAULT '0',
`deleted` tinyint(1) unsigned NOT NULL DEFAULT '0',
`date` date NOT NULL DEFAULT '0000-00-00',
`time` time NOT NULL DEFAULT '00:00:00',
`confid` smallint(5) unsigned DEFAULT NULL,
`srs-predict` tinyint(3) unsigned NOT NULL,
`srs-teamid` smallint(5) unsigned NOT NULL,
`crs-predict` tinyint(3) unsigned NOT NULL,
`crs-teamid` smallint(5) unsigned NOT NULL,
`winner` smallint(5) unsigned DEFAULT NULL,
`forfeit` tinyint(1) DEFAULT NULL,
`playoff` tinyint(1) unsigned DEFAULT NULL,
`H1` tinyint(3) unsigned DEFAULT NULL,
`H2` tinyint(3) unsigned DEFAULT NULL,
`H3` tinyint(3) unsigned DEFAULT NULL,
`H4` tinyint(3) unsigned DEFAULT NULL,
`H5` tinyint(3) unsigned DEFAULT NULL,
`H6` tinyint(3) unsigned DEFAULT NULL,
`H7` tinyint(3) unsigned DEFAULT NULL,
`H8` tinyint(3) unsigned DEFAULT NULL,
`A1` tinyint(3) unsigned DEFAULT NULL,
`A2` tinyint(3) unsigned DEFAULT NULL,
`A3` tinyint(3) unsigned DEFAULT NULL,
`A4` tinyint(3) unsigned DEFAULT NULL,
`A5` tinyint(3) unsigned DEFAULT NULL,
`A6` tinyint(3) unsigned DEFAULT NULL,
`A7` tinyint(3) unsigned DEFAULT NULL,
`A8` tinyint(3) unsigned DEFAULT NULL,
`reportedby` int(10) unsigned DEFAULT NULL,
`lastscandate` date DEFAULT NULL,
PRIMARY KEY (`gameid`),
KEY `winner` (`winner`),
KEY `date` (`date`),
KEY `hometeam` (`hometeam`),
KEY `awayteam` (`awayteam`),
KEY `sportid` (`sportid`),
KEY `lastscandate` (`lastscandate`),
KEY `deleted` (`deleted`),
KEY `sportid_2` (`sportid`,`awayteam`,`date`),
KEY `sportid_3` (`sportid`,`hometeam`,`date`),
KEY `sportid_4` (`sportid`,`awayteam`,`date`,`deleted`),
KEY `sportid_5` (`sportid`,`hometeam`,`date`,`deleted`),
KEY `sportid_6` (`sportid`,`hometeam`,`awayteam`,`date`,`deleted`)
) ENGINE=InnoDB AUTO_INCREMENT=1969140 DEFAULT CHARSET=utf8
Run Code Online (Sandbox Code Playgroud)
ype*_*eᵀᴹ 14
尝试添加两个索引:
ALTER TABLE game
ADD INDEX deleted_sportid_hometeam_date_IX -- choose names
(deleted, sportid, hometeam, date),
ADD INDEX deleted_sportid_awayteam_date_IX -- for the indexes
(deleted, sportid, awayteam, date) ;
Run Code Online (Sandbox Code Playgroud)
然后运行这个版本:
SELECT * FROM game
WHERE hometeam = 29
AND sportid = 1
AND date BETWEEN '2012-07-01' AND '2013-06-30'
AND deleted = 0
UNION ALL
SELECT * FROM game
WHERE awayteam = 29
AND sportid = 1
AND date BETWEEN '2012-07-01' AND '2013-06-30'
AND deleted = 0 ;
Run Code Online (Sandbox Code Playgroud)
添加 2 个索引后,您仍然可以尝试原始查询,效率可能会提高(但不会太多,取决于deleted - sportid组合的选择性。)但我认为优化器不够聪明,无法理解这一点(重写)等同于(原始查询)并且它可以使用两个索引,一个用于第一部分,另一个用于第二部分,因此您只会获得很小的效率增益。
因此,“为什么以这种方式更快”主要与OR条件和优化器以等效形式重写查询的能力有关。例如,这种重写永远不会由自动优化器产生(因为我假设hometeam和awayteam永远不会相同,优化器无法猜测。)如果主队和客队可能相同,那么我们必须使用UNION(不是UNION ALL)。
B 树索引仅适用于具有AND, 的条件。当有ORs或其他复杂的条件时,它们不是那么好。偶尔 - 就像在这种情况下 - 有一种方法可以重写查询,因此它只有ANDs. 执行的最后一部分 (the UNION ALL) 可以通过一个接一个地运行两个子查询并显示来自两者的所有结果在 MySQL 中执行,因此那里没有计算或延迟。