November 3, 2003 at 8:01 am
For clustered index it is said that the leaf node contains data.
It means if you are pointing to a particular index node in the B-Tree of clustered index then you are actually (indirectly) accessing the data.
This is the major benefit of clustered index over non-clustered index because non-clustered stores a pointer due to which accessing data takes one more step.
Now my question is how SQL server implements these data structures and how these things actually work.?
November 3, 2003 at 8:22 am
Can you get hands on Inside SQL Server 2000 ?
Explains this all in depth.
Frank
--
Frank Kalis
Microsoft SQL Server MVP
Webmaster: http://www.insidesql.org/blogs
My blog: http://www.insidesql.org/blogs/frankkalis/[/url]
November 4, 2003 at 5:36 am
Sql server 2000 Performance Tuning
By Whalen Garcia Deluca Thompson Helped me out on that
Mike
Viewing 3 posts - 1 through 2 (of 2 total)
You must be logged in to reply to this topic. Login to reply