Perl-Sensitive Sunglasses | |
PerlMonks |
MySQL Select Speed Optimisationby tachyon (Chancellor) |
on Mar 27, 2003 at 09:50 UTC ( [id://246196]=perlquestion: print w/replies, xml ) | Need Help?? |
tachyon has asked for the wisdom of the Perl Monks concerning the following question: I have a table in a MySQL database that I need to optimise the speed of searching on. It looks like this:
The select that has to run against it is very simple and looks like
There are no like operators and the statement handles are all prepare cached and cached themselves with the bind values passed to the execute as needed. Implicit in the MySQL docs is the notion that a B-tree index is automatically created for the primary key. It is not however explicit. So the question is does a primary key need an index to optimise search speed? Having just written this the obvious answer is just to test it I guess. Still I am lazy enough to seek the wisdom of the monks as a shortcut... cheers tachyon s&&rsenoyhcatreve&&&s&n.+t&"$'$`$\"$\&"&ee&&y&srve&&d&&print
Back to
Seekers of Perl Wisdom
|
|