Re:Finding unique items: hash vs. sort
by barrkel on Wednesday January 08, 2020 @12:33AM
(#21988645)
I've made large joins faster in MySQL by adding gratuitous order by to derived table queries, which lead to probing the index in the join in index order instead of a different, more random, order. The cost of the extra redundant sort was less than the cost of the random btree traversals.
[ Parent
| on HN ]
There are no comments on this comment yet.