is php sort better than mysql “order by”?

by

mySQL, hands down. It’s optimized to do this, and can make use of indexes. This would be horrible to do in PHP (and you would reach the memory_limit quickly).

More Related Contents:

  1. MyISAM versus InnoDB [closed]
  2. How can i optimize MySQL’s ORDER BY RAND() function?
  3. Why does MYSQL higher LIMIT offset slow the query down?
  4. Is there a REAL performance difference between INT and VARCHAR primary keys?
  5. How to find similar results and sort by similarity?
  6. Mysql: Select rows from a table that are not in another
  7. Sorting varchar field numerically in MySQL
  8. Mysql order by specific ID values
  9. MySQL: Fastest way to count number of rows
  10. MySQL vs MongoDB 1000 reads
  11. MySQL stored procedures use them or not to use them
  12. UUID performance in MySQL?
  13. MySQL “IN” operator performance on (large?) number of values
  14. How can I speed up a MySQL query with a large offset in the LIMIT clause?
  15. Optimal MySQL settings for queries that deliver large amounts of data?
  16. What is better in MYSQL count(*) or count(1)?
  17. DOs and DONTs for Indexes [closed]
  18. MySQL performance: multiple tables vs. index on single table and partitions
  19. MySQL view performance
  20. “SELECT COUNT(*)” is slow, even with where clause
  21. Higher cardinality column first in an index when involving a range?
  22. Does Order of Fields of Multi-Column Index in MySQL Matter
  23. sql group by versus distinct
  24. mysql custom sort
  25. How can “set timestamp” be a slow query?
  26. Would it help to add index to BIGINT column in MySQL?
  27. ALTER TABLE ADD COLUMN takes a long time
  28. ORDER BY alphabet first then follow by number
  29. Composite Primary Key performance drawback in MySQL
  30. Default sort-ordering in MySQL (ALTER TABLE … ORDER BY …;)

Leave a Comment