December 28, 2003 at 12:00 am
Comments posted to this topic are about the content posted at http://www.sqlservercentral.com/columnists/rgummadi/indexingstrategies.asp
Ramesh Gummadi
January 7, 2004 at 7:24 am
Excellent article - well done !!!
January 7, 2004 at 7:49 am
Well done. Very informative.
Ross
January 7, 2004 at 10:38 am
It's good, but somewhat inaccurate. In the first section about filtering on member_number, it says that the leaf level of the non-clusterd index has the row ID. This is true only if the table is a heap table (has no clusterd index on it). If the table does have a clustered index, the leaf level of the non-clustered index on member_nember constains the clustered key value, which is then used to do a clustered index seek to get to the actual data.
January 7, 2004 at 11:05 am
great article
very informative
January 7, 2005 at 2:49 am
I concur, very good article! Now all you need is an animated graphics design to walk through the process using the examples in b-tree format for visualization.
Viewing 6 posts - 1 through 6 (of 6 total)
You must be logged in to reply to this topic. Login to reply
This website stores cookies on your computer.
These cookies are used to improve your website experience and provide more personalized services to you, both on this website and through other media.
To find out more about the cookies we use, see our Privacy Policy