Home > Archive > MS SQL Server > April 2006 > Time complexity of index creation on pre-sorted data









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author Time complexity of index creation on pre-sorted data
Thomas Kejser

2006-04-04, 9:23 am

Hi everyone

Does anyone know which sort algorithm is used by the SQL Server index
creation?

Can I generally be sure that a sort of a pre-sorted table (eg. clustering a
heap) can be performed in linear time or shall i still expect O(n log n)
complexity


--
Thomas Kejser
Doug

2006-04-06, 8:23 pm

in my experience, time for index creation is pretty much independent of
the original ordering of the table in question.

YMMV. I'd be very curious for someone to tell me if I'm incorrect.

Sponsored Links





Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive | Programming forum archive

Copyright 2008 droptable.com