On Thu, 6 Mar 2003, Greg Lepore wrote: > 18 hours. Is this an obvious result of the increasing size of the > database, or should I be looking for an answer elsewhere (I/O etc.)?
Yes. Few algorithms have linear growth, and indexing is certainly one of them. Sorting, for example, goes up proportional to n*log n in the average case usually. (Not to get off-topic into computer science and analyzing algorithms.) -- -Geoff Hutchison Williams Students Online http://wso.williams.edu/ ------------------------------------------------------- This SF.net email is sponsored by:Crypto Challenge is now open! Get cracking and register here for some mind boggling fun and the chance of winning an Apple iPod: http://ads.sourceforge.net/cgi-bin/redirect.pl?thaw0031en _______________________________________________ htdig-general mailing list <[EMAIL PROTECTED]> To unsubscribe, send a message to <[EMAIL PROTECTED]> with a subject of unsubscribe FAQ: http://htdig.sourceforge.net/FAQ.html
