This is a question just for the sake of asking:
Barring all intermediate to advanced topics or techniques (clustered indices, BULK INSERTS, export/import tricks, etc.), does an INSERT take longer the larger a table grows?
This assumes that there is only one auto-int column, ID [i.e., all new rows are INSERTED at the bottom, where no memory has to shuffled to accommodate a specific row positioning].
A link to a good “benchmarking MySQL” would be handy. I took Oracle in school, and so far the knowledge has done me little good on SO.
Thanks everyone.
My experience has been that performance degrades if the dataset index no longer fits in memory. Once that happens, checks for duplicate indexes will have to hit disk and it will slow down considerably. Make a table with as much data as you think you’ll have to deal with, and do some testing and tuning. It’s really the best way to know what you’ll run into.