Kefah T. Issa <[EMAIL PROTECTED]> wrote:
I tried the ordered-urls-insert the results were better, but it is
still
taking progressively longer time as the number of records increases.
A fundamental question to be asked here :
Shouldn't the time complexity (Big-O) of the insert operation be
constant?
Of course not. It takes O(log N) to find an appropriate place in the
index for every new record (where N is the number of records already
inserted). Also, it generates a lot of disk activity once the index
grows too large to fit in memory cache.
I even did a third test where the integer primary key is not auto
increment;
the same problem is observed.
The id is not a problem: O(log N) is caused by the index on url.
Igor Tandetnik
-----------------------------------------------------------------------------
To unsubscribe, send email to [EMAIL PROTECTED]
-----------------------------------------------------------------------------
