non-leaf-level pages and leaf-level pages?

Hi
What is de diferents beetwen non-leaf-level pages and leaf-level pages?
Thanks
Best Regards
CesarThe 'non-leaf level pages are key-value pairs used to navigate down to the
'leaf-level' pages desired.
For a clustered index, the 'leaf-level' pages are where the table data is
actually stored.
For non-clustered indexes, the 'leaf-level' pages contain key-value pairs
directing the search to either the key used in a clustered index, or to a
pointer to the heap where data is stored since it is not clustered.
For a more detailed description, check Books on Line.
--
Arnie Rowland, Ph.D.
Westwood Consulting, Inc
Most good judgment comes from experience.
Most experience comes from bad judgment.
- Anonymous
"Cesar" <hgfdhfg@.jksjn.com> wrote in message
news:%23G8R4l$uGHA.1372@.TK2MSFTNGP04.phx.gbl...
> Hi
> What is de diferents beetwen non-leaf-level pages and leaf-level pages?
> Thanks
> Best Regards
> Cesar
>|||Cesar wrote:
> Hi
> What is de diferents beetwen non-leaf-level pages and leaf-level pages?
> Thanks
> Best Regards
> Cesar
>
Imagine a tree growing in your back yard. Your data (or pointers to
your data) is stored in the leaves of the tree, or at the "leaf level".
To reach those leaves, you have to climb the tree, moving from branch
to branch until you reach the desired leaf. Every time you reach a fork
in the tree, you have to make a decision as to which branch of the fork
you should follow.
The database engine has to do the same thing, only with a binary data
tree. When it reaches a fork in the tree, it has to decide which branch
to take. It makes that decision by looking at data stored at the
"non-leaf level".
Tracy McKibben
MCDBA
http://www.realsqlguy.com|||Thanks Tracy ..
"Tracy McKibben" <tracy@.realsqlguy.com> ha scritto nel messaggio
news:u0w214HvGHA.1372@.TK2MSFTNGP04.phx.gbl...
> Cesar wrote:
> > Hi
> > What is de diferents beetwen non-leaf-level pages and leaf-level pages?
> > Thanks
> >
> > Best Regards
> >
> > Cesar
> >
> >
> Imagine a tree growing in your back yard. Your data (or pointers to
> your data) is stored in the leaves of the tree, or at the "leaf level".
> To reach those leaves, you have to climb the tree, moving from branch
> to branch until you reach the desired leaf. Every time you reach a fork
> in the tree, you have to make a decision as to which branch of the fork
> you should follow.
> The database engine has to do the same thing, only with a binary data
> tree. When it reaches a fork in the tree, it has to decide which branch
> to take. It makes that decision by looking at data stored at the
> "non-leaf level".
>
> --
> Tracy McKibben
> MCDBA
> http://www.realsqlguy.com|||Thanks Arnie.
"Arnie Rowland" <arnie@.1568.com> ha scritto nel messaggio
news:eVkyoSAvGHA.3500@.TK2MSFTNGP06.phx.gbl...
> The 'non-leaf level pages are key-value pairs used to navigate down to the
> 'leaf-level' pages desired.
> For a clustered index, the 'leaf-level' pages are where the table data is
> actually stored.
> For non-clustered indexes, the 'leaf-level' pages contain key-value pairs
> directing the search to either the key used in a clustered index, or to a
> pointer to the heap where data is stored since it is not clustered.
> For a more detailed description, check Books on Line.
> --
> Arnie Rowland, Ph.D.
> Westwood Consulting, Inc
> Most good judgment comes from experience.
> Most experience comes from bad judgment.
> - Anonymous
>
> "Cesar" <hgfdhfg@.jksjn.com> wrote in message
> news:%23G8R4l$uGHA.1372@.TK2MSFTNGP04.phx.gbl...
> > Hi
> > What is de diferents beetwen non-leaf-level pages and leaf-level pages?
> > Thanks
> >
> > Best Regards
> >
> > Cesar
> >
> >
>