MySQL 8.0

By using db<>fiddle, you agree to license everything you submit by Creative Commons CC0.

CREATE TABLE PartitionedTable (
  id int(11) NOT NULL AUTO_INCREMENT,
  col int,
  PRIMARY KEY (id),
  KEY(col)
) PARTITION BY RANGE(id) (
    PARTITION p0 VALUES LESS THAN (2000),
    PARTITION p1 VALUES LESS THAN (4000),
    PARTITION p2 VALUES LESS THAN (6000),
    PARTITION p3 VALUES LESS THAN (8000),
    PARTITION p4 VALUES LESS THAN MAXVALUE
    );
INSERT INTO PartitionedTable (col)
SELECT FLOOR(RAND() * 1000)  AS col FROM 
(select 0 union all select 1 union all select 2 union all select 3 union all select 4 union all select 5 union all select 6 union all select 7 union all select 8 union all select 9) t,
(select 0 union all select 1 union all select 2 union all select 3 union all select 4 union all select 5 union all select 6 union all select 7 union all select 8 union all select 9) t2, 
(select 0 union all select 1 union all select 2 union all select 3 union all select 4 union all select 5 union all select 6 union all select 7 union all select 8 union all select 9) t3, 
(select 0 union all select 1 union all select 2 union all select 3 union all select 4 union all select 5 union all select 6 union all select 7 union all select 8 union all select 9) t4 ;

EXPLAIN ANALYZE SELECT col FROM PartitionedTable WHERE id >= 6000 AND id < 8000 ORDER BY col DESC LIMIT 1;
EXPLAIN ANALYZE SELECT MAX(col) FROM PartitionedTable WHERE id >= 6000 AND id < 8000;

EXPLAIN
-> Limit: 1 row(s) (actual time=0.030..0.030 rows=1 loops=1) -> Filter: ((PartitionedTable.id >= 6000) and (PartitionedTable.id < 8000)) (cost=0.10 rows=1) (actual time=0.030..0.030 rows=1 loops=1) -> Index scan on PartitionedTable using col (reverse) (cost=0.10 rows=1) (actual time=0.028..0.028 rows=1 loops=1)

EXPLAIN
-> Aggregate: max(PartitionedTable.col) (actual time=0.893..0.893 rows=1 loops=1) -> Filter: ((PartitionedTable.id >= 6000) and (PartitionedTable.id < 8000)) (cost=400.26 rows=2000) (actual time=0.027..0.765 rows=2000 loops=1) -> Index range scan on PartitionedTable using PRIMARY (cost=400.26 rows=2000) (actual time=0.026..0.551 rows=2000 loops=1)