Post reply

Indexing Strategies

  • December 28, 2003 at 12:00 am

    #65758

    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

    #488953

    Excellent article - well done !!!

  • January 7, 2004 at 7:49 am

    #488959

    Well done. Very informative.

    Ross

  • January 7, 2004 at 10:38 am

    #489015

    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

    #489017

    great article

    very informative

  • January 7, 2005 at 2:49 am

    #536343

    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 5 (of 5 total)

You must be logged in to reply to this topic. Login to reply