find no.of pages and levels deep

Tech Tip: Click here to run a free scan for Windows Errors and optimize PC performance

From: Hassan (fatima_ja_at_hotmail.com)
Date: 07/22/04 

Date: Wed, 21 Jul 2004 23:01:26 -0700

Take the authors table as an example in the pubs database...

How can I find how many levels within the B-Tree from the root to the level
that contains the data rows (clustered index) ? Also how many pages at each
level within that B-Tree ?

Will i have 2 B-Trees now, one for the clustered index and one for the
non-clustered ? Using SQL 2000

Relevant Pages

  • Re: Clustered index vs. nonclustered index for GUID primary key
    ... non-clustered seek because a bookmark lookup is not needed. ... clustered index is a B-tree with the actual data pages as leaf nodes. ... > for GUID primary key will result a faster select operation when we look up ...
    (microsoft.public.sqlserver.server)
  • Re: Clustered index vs. nonclustered index for GUID primary key
    ... non-clustered seek because a bookmark lookup is not needed. ... clustered index is a B-tree with the actual data pages as leaf nodes. ... > for GUID primary key will result a faster select operation when we look up ...
    (microsoft.public.sqlserver.programming)
  • Re: find no.of pages and levels deep
    ... > Take the authors table as an example in the pubs database... ... > level within that B-Tree? ... level of the clustered index. ...
    (microsoft.public.sqlserver.server)
  • Re: Newbie help
    ... "Hugo Kornelis" wrote: ... > If I ask you to look at page 364, you'll use the clustered index to find ... > (though not completely he same, as the book is not ordered as a B-tree). ... It could still have a keyword ...
    (microsoft.public.sqlserver.programming)
  • Re: TO_DATE function causes table scan
    ... I would create a clustered index (leaf node of the b-tree points ... If the table gets very large, partitioning on ALM_DATE might also help. ...
    (comp.databases.oracle.tools)