index update speed

[crmalibu]

http://dev.mysql.com/doc/refman/5.0/...ert-speed.html

The size of the table slows down the insertion of indexes by log N, assuming B-tree indexes.

N stands for how many rows in the table?

So for a table with:
100 rows, slowdown = 1
1,000 rows, slowdown = 2
10,000 rows, slowdown = 3
100,000 rows, slowdown = 4

Is my understanding correct?

[Dan Grossman]

You're off by 1 assuming log base 10, but that's the right idea.

The base of the log isn't 10, though. A B-tree data structure enforces a logarithmic relationship between the number of nodes and the height of the tree, but the base depends on the implementation.

[crmalibu]

Thanks