Given two tables of equal structure, only one with 100M rows and the other with 100 rows, will card inserts take more time up for grabs with increased rows?

Why?

Place takes a longer period for 100M rows particularly if among the posts is indexed. Due to the indexing, it'll have to index the brand new placed row accordingly that takes additional time. The index is a great choice for choose claims, but when you've more card inserts it turns into a discomfort because it takes additional time to place.

Yes. Even much more if you will find indexes set on the table. This thread may well be a good read for you personally.

Yes. Especially due to the indexes. If you will find indexes defined for your table, then for every place, some information have to be carried out.

E.g. When the index state that it orders the rows inside a sorted manner, when you place a brand new row are looking for the positioning for your row within the index column. There can be a binary search formula which performs this. If you will find 100 rows, it will require log(100) time but when you will find 100M rows, it will require log(100M) time.

If the index is used to some column, and new rows aren't placed sequentially based on the index, then you will see some performance penalty from placing values into the center of the index, which in turn causes the index to become updated. However, you will not go through the penalty on each place. There's some room inside a BTREE index to place a couple of new nodes in the centre without needing to restructure the index.

Without sufficient memory, you might encounter paging difficulties with the index too.

Ofcourse. Within difference by microseconds.