RE: How does Oracle keep B-tree indexes to 3 levels?

From: Prem Khanna J <jprem_at_kssnet.co.jp>
Date: Fri, 6 Feb 2004 13:57:29 +0900
Message-ID: <001f01c3ec6d$b91afd50$dd00a8c0@prem>

Hi Cary & List ,

i have been long trying to get a pictorial representation of a simple b-tree index and how it changes as the index grows . Though i read the docs , still i'm not able to say "okay , this is how b-tree index works" .

Has anyone got something like what i'm looking for ?

Just curious to know :
Cary , what does * Nullius in verba * mean ?

Regards,
Prem.

>>-----Original Message-----
>>From: oracle-l-bounce_at_freelists.org
>>
>>You get a new level only if the parent node splits propagate
>>all the way
>>to the index root node. Jonathan Lewis and Steve Adams have some good
>>tests in their courses that use block dumps to show how Oracle
>>redistributes keys in branch blocks when nodes split.
>>
>>Yes, Oracle index nodes are one block apiece.

>>Cary Millsap
>>* Nullius in verba *

---

Please see the official ORACLE-L FAQ: http://www.orafaq.com

---

To unsubscribe send email to: oracle-l-request_at_freelists.org put 'unsubscribe' in the subject line.

--
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 Thu Feb 05 2004 - 22:57:29 CST