summaryrefslogtreecommitdiff
path: root/mysql-test/r/backup.result
diff options
context:
space:
mode:
authorunknown <timour@askmonty.org>2013-02-13 11:58:16 +0200
committerunknown <timour@askmonty.org>2013-02-13 11:58:16 +0200
commitd4b1e8f31a2d0e71a79c2b81b3a303c769f68cd0 (patch)
treec636bec2b06d5eb4fe1a9cb242328856e249f9bc /mysql-test/r/backup.result
parent3a0b25bb07e39d183202fa710ed8bc23a00ad162 (diff)
downloadmariadb-git-d4b1e8f31a2d0e71a79c2b81b3a303c769f68cd0.tar.gz
Fix for MDEV-4140
Analysis: Range analysis detects that the subquery is expensive and doesn't build a range access method. Later, the applicability test for loose scan doesn't take that into account, and builds a loose scan method without a range scan on the min/max column. As a result loose scan fetches the first key in each group, rather than the first key that satisfies the condition on the min/max column. Solution: Since there is no SEL_ARG tree to be used for the min/max column, it is not possible to use loose scan if the min/max column is compared with an expensive scalar subquery. Make the test for loose scan applicability to be in sync with the range analysis code by testing if the min/max argument is compared with an expensive predicate.
Diffstat (limited to 'mysql-test/r/backup.result')
0 files changed, 0 insertions, 0 deletions