任务：对于每篇文章，找到最贵价格的经销商或经销商。

这个问题可以使用类似于以下的子查询来解决

SELECT article, dealer, price
FROM   shop s1
WHERE  price=(SELECT MAX(s2.price)
              FROM shop s2
              WHERE s1.article = s2.article)
ORDER BY article;

+---------+--------+-------+
| article | dealer | price |
+---------+--------+-------+
|    0001 | B      |  3.99 |
|    0002 | A      | 10.99 |
|    0003 | C      |  1.69 |
|    0004 | D      | 19.95 |
+---------+--------+-------+

前面的示例使用的是相关子查询，这可能效率低下（参见第 15.2.15.7 节，“相关子查询”）。解决此问题的其他方法包括在FROM 子句中使用非相关子查询、LEFT JOIN 或使用窗口函数的公共表表达式。

非相关子查询

SELECT s1.article, dealer, s1.price
FROM shop s1
JOIN (
  SELECT article, MAX(price) AS price
  FROM shop
  GROUP BY article) AS s2
  ON s1.article = s2.article AND s1.price = s2.price
ORDER BY article;

LEFT JOIN:

SELECT s1.article, s1.dealer, s1.price
FROM shop s1
LEFT JOIN shop s2 ON s1.article = s2.article AND s1.price < s2.price
WHERE s2.article IS NULL
ORDER BY s1.article;

LEFT JOIN 的工作原理是，当s1.price 处于其最大值时，不存在具有更大值的s2.price，因此相应的s2.article 值为NULL。参见第 15.2.13.2 节，“JOIN 子句”。

使用窗口函数的公共表表达式

WITH s1 AS (
   SELECT article, dealer, price,
          RANK() OVER (PARTITION BY article
                           ORDER BY price DESC
                      ) AS `Rank`
     FROM shop
)
SELECT article, dealer, price
  FROM s1
  WHERE `Rank` = 1
ORDER BY article;