Re: [PHP] scoring/sorting db search results based on score

[Marek Kilimajer]

I don't know how postgres server would optimize the query, but in teory 
there should be only a slight overhead as the (I)LIKE results should be 
cached. How much takes to order by depends on the number of rows returned.

Dave [Hawk-Systems] wrote:
Appreciate the responses...

We are talking a db of under 10k records where the search would take place on.
what are the ramifications of this as a load on the postgres server?  Wouldn't
want to have a great search query that grinds the server to a halt everytime
someone searches regardless of the accuracy of the end result :)
Thanks

Dave





--
PHP General Mailing List (http://www.php.net/)
To unsubscribe, visit: http://www.php.net/unsub.php