I have a table that is the data source of a nested tree structure, and I
intended to use this:
UserID INTEGER,
FolderID INTEGER,
FolderName VARCHAR[64] or maybe CHAR[64],
MasterID INTEGER,
My question is this, how much will an ORDER BY FolderName slow this down
by? This query will be run many many thousands of times a day, and I
would like to know if it would be better to sort it in the cgi, or in SQL
(which would obviously be alot easier). I am just looking for a ball park
increase like 10% 100% etc.
Thanks
Eric Savage
esavage@stripped
| Thread |
|---|
| • ORDER BY Optimization | Eric Savage | 26 Apr |