NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.
All the Perl that's Practical to Extract and Report
Stories, comments, journals, and other submissions on use Perl; are Copyright 1998-2006, their respective owners.
but speed is important... (Score:2)
as if those two sentences are contradicting.
IMHO These people usually come from some C/C++ background or have been working on code where the someone (maybe they themselves) wrote an algorithm that was O(2^n) instead of O(n^2) or even O(n).
In the distant past I too had once a mistake writing an O(2^n) algorithm in LISP that blew up somewhere around n=3 or so. I had to go back and fix it. Since then I am thinking more about su
Re: (Score:1)
The disease is called 'Premature optimization' and is the root of all evil according to Donald Knuth.
Regarding indexes, you can also have too many. I once had a task to find out why a page in RT took 6 seconds to load.
It turned out there were two almost identical indexes, one with two columns, the other with three, an extra column added at the end.
Removing one of the indexes cut the load time of the page to approximately ½ a second. Now I don't know excatly why that was a problem for the DBS, but