Re: svnadmin verify performance issue (was: Re: How long do your svn dumps take)

On Fri, Apr 24, 2009 at 17:33, Branko Čibej <brane_at_xbc.nu> wrote:
> Greg Stein wrote:
>> Note that filling a *large* hash table has O(N^2) time complexity,
>> which is why it gets so slow, I bet. Each time that hash table has to
>> grow, it needs to re-insert all the previously-inserted entries.
>>
>
> I thought it was O(N logN) if the hash table doubles in size every time
> it has to grow?

Could be. Not concerned anough to apply the brain power, so I'll just
take your word for it, or to say it is "somewhere in there".

Cheers,
-g

------------------------------------------------------
http://subversion.tigris.org/ds/viewMessage.do?dsForumId=462&dsMessageId=1894337
Received on 2009-04-24 17:54:11 CEST