Well considering the index will not be compiled in real time and probably updated lets say, for the sake of argument, every other day, the resources would be minimal after memcache ing and then mysql query cache. Since these are read-often write-seldom records the query cache would really excel here. and thats my 2ยข
On 8/4/06, Simetrical Simetrical+wikitech@gmail.com wrote:
On 8/4/06, Aerik Sylvan aerik@thesylvans.com wrote:
I have always assumed that MySQL is internally optimised enough that if
one
sticks to simple queries and whole word matches, you get pretty good performance - but that's an assumption on my part. I'm very interested
in
that because I'd like to know more about optimising search queries, but
of
course it's not your problem to teach me.
MySQL can only be as optimized as the algorithm that uses it. LIKE may be optimized, but it's impossible to make it very efficient given what it does.
Timwi, from your other posts I can see that you know a lot more about computer programming than I do, but I would hope to be able to offer
some
opinion without getting slapped with "obvious and naive".
I don't think he meant it as an insult. In computer science, "naive" basically means "the most obvious way to accomplish something, which is probably not a good idea performance-wise". _______________________________________________ Wikitech-l mailing list Wikitech-l@wikimedia.org http://mail.wikipedia.org/mailman/listinfo/wikitech-l