Hi!
>>>>> "Emmanuel" == Emmanuel van der Meulen <[EMAIL PROTECTED]> writes: Emmanuel> Hello Monty, Emmanuel> With your help I'm getting the understanding I was looking for, thank you. <cut> >> Note however that if there would have been less matching rows (for >> example 60), the SQL_CALC_FOUND_ROWS method is much faster... Emmanuel> Seeing as the sort would only be of 60 records. Yes. <cut> >> In many cases it's enough to show X members and then have a link 'show >> the next X members', that is only shown if there is more than X >> members. The speedup you get for doing this is in many case worth the >> small inconvenience for your users.. Emmanuel> Point taken and a neat way to overcome the delay for getting the total Emmanuel> count. BTW, in this case I do not show all the detail, only the most recent Emmanuel> members that joined. Yes; I have used the above solution on many web pages. It's kind of nice as it guarantees you a very good speed, independent of the number of rows that matches your where clause... Regards, Monty --------------------------------------------------------------------- Before posting, please check: http://www.mysql.com/manual.php (the manual) http://lists.mysql.com/ (the list archive) To request this thread, e-mail <[EMAIL PROTECTED]> To unsubscribe, e-mail <[EMAIL PROTECTED]> Trouble unsubscribing? Try: http://lists.mysql.com/php/unsubscribe.php
