Oracle FAQ | Your Portal to the Oracle Knowledge Grid |
![]() |
![]() |
Home -> Community -> Usenet -> c.d.o.server -> Re: About Index B-Tree Problem!!
That is correct, but the balancing refers to the fact that
the height of the tree is uniform (+/- 1 level) across the
whole tree.
There are some circumstances where the amount of data per leaf varies greatly across the b-tree.
--
Jonathan Lewis
Yet another Oracle-related web site: www.jlcomp.demon.co.uk
Matthew McPeak wrote in message ...
>
>I was under the impression that Oracle always keeps its indexes balanced,
>even after inserts and deletes. Is this not the case?
Received on Wed Jun 09 1999 - 14:24:31 CDT
![]() |
![]() |