February 12, 2007 at 5:53 am
Hi all,
I am eagerly waiting to know that which is the default search algorithm used in SQL 2000. Whether it is sequential or binary search? No index defined in table.
February 12, 2007 at 8:25 am
I fail to see the relevence of this question. As your table is presumably a heap it will do a table scan which would be sequential , no other way for it to do this.
Please define what you mean by a binary search.
[font="Comic Sans MS"]The GrumpyOldDBA[/font]
www.grumpyolddba.co.uk
http://sqlblogcasts.com/blogs/grumpyolddba/
February 13, 2007 at 7:19 am
This "default search algorithm" is to use the most applicable index in a way that minimizes resource usage based on the estimated results.
This can mean many things. In your case, it will search all the rows in your table one by one, in whatever order it retrieves the rows from disk or buffer cache. So the answer to your question is "neither" in your case.
Viewing 3 posts - 1 through 2 (of 2 total)
You must be logged in to reply to this topic. Login to reply