> Isn't it so that it firstly order the rows by id (index'ed?) and then scan > it to pick the rows which satisfy the where clause? > > It stops when the result reaches the limit, otherwise scans the whole (27, > 000 rows scan). > > Then the response time with 2 rows limit by 2 can really depend. If the ma > tching 2 rows reside at the very beginning of the id ordered result, it ca > n be very fast (2 rows scan), but if they are located at the end, it can t > ake as long as the full table scan. > > Correct me if I'm wrong.
Thanks for the response. I've had a deeper look at it appears an issue with the optimizer... I think I need to create some more Indexes. -Kristian -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe: http://lists.mysql.com/mysql?unsub=arch...@jab.org
