> Imagine I had a table with 50,000,000 rows, would it improve search
speeds
> if I split it up into smaller tables of 10,000,000 rows each? This means
> if I had to search for a record, I'd have to query the 5 tables one after
> the other.
Which is likely to be slower. If you have good indexes for your search, and
indexed search is likely to perfom of the order of log(number of rows) or
better. Splitting the table will give a relatively small change in thsi
figure, while having to be done 5 times. The whole poi t of a well indexed
database is that absolute size is not, per se, a problem. Just give it lots
of Ram so that it can cache its indexes in mamory, and it will perform very
well.
Alec
--
MySQL General Mailing List
For list archives: http://lists.mysql.com/mysql
To unsubscribe: http://lists.mysql.com/[EMAIL PROTECTED]
