We will install a webserver that writes access logs to a MySQL table. Access logs of course will get really really big, so this will be a separate MySQL instance from the regular data and we will more librally delete the binlogs.
We will also have to delete older items from the table which means delete commands and optimize commands that will make the inserts wait.
Is there a way to have delayed inserts that are in a preserved order and that will occasionally tolerate many items in the delayed insert queue?
If the inserts will get mixed up then it is not a show stopper. We can use timestamps and milliseconds for sorting.
Also, can we prevent wasteful growth of index files? Perhaps we can optimize the indexes similar to optimizing the data files? Would requiring the indexes to be fixed width prevent data rotation waste problems?