Oracle FAQ | Your Portal to the Oracle Knowledge Grid |
![]() |
![]() |
Home -> Community -> Mailing Lists -> Oracle-L -> Re: RE: How does Oracle keep B-tree indexes to 3 levels?
Oracle doesn't do it.
I think the merge and re-distribute features are part of the definition of B*trees, and although Oracle claims (at some points in the manual) to do B*, it's really only doing a variant of B+ (which I think is when there are forward and backward pointers between adjacent leaf blocks).
(I should probably have used the word NODE rather than block, because I think that Oracle uses blocks as nodes)
Regards
Jonathan Lewis
http://www.jlcomp.demon.co.uk
The educated person is not the person who can answer the questions, but the person who can question the answers -- T. Schick Jr
Next public appearances:
March 2004 Hotsos Symposium - The Burden of Proof
March 2004 Charlotte NC OUG - CBO Tutorial
April 2004 Iceland
One-day tutorials:
http://www.jlcomp.demon.co.uk/tutorial.html
Three-day seminar:
see http://www.jlcomp.demon.co.uk/seminar.html
____UK___February
____UK___June
The Co-operative Oracle Users' FAQ
http://www.jlcomp.demon.co.uk/faq/ind_faq.html
how does oracle determine underflow? In class the professor said that if = a block is less than 1/2 full the block is either merged with another blo= ck if it can fit, or the data is redistributed amongst multiple blocks. =
Oracle doesn't have a pctused for indexes. The pctfree is the overflow. D= oes oracle use the 1/2 full line for underflow? =
> =
-- Archives are at http://www.freelists.org/archives/oracle-l/ FAQ is at http://www.freelists.org/help/fom-serve/cache/1.html -----------------------------------------------------------------Received on Fri Feb 06 2004 - 07:43:28 CST
![]() |
![]() |