Re: I wanna know how Oracle uses file organization in their DB

There is quite some important difference between theoretical definition of the B*/+ trees and their implementation, in particular underflow and overflow could be implemented not as defined -- a trade off, as usually -- however those two operations are major ones in the index data management. Knuth's book does not reflect such nuances as concurrent operations against {B, B+, B*}-trees in particular, at least in the chapter of the book Cary mentioned. I think, some more information can be found on acm.

Thai, I do not think that such documents are openly available -- never read those :), but, definitely, knowledge of some basic principles would help -- so start from the Knuth's books.

regards,

-- 
Vladimir Begun
The statements and opinions expressed here are my own and
do not necessarily represent those of Oracle Corporation.

Tanel Poder wrote:
> Hi!
> 
> If I recall correctly, a simple B-tree leafs didn't have pointers to last
> and next leaf in them, whilst B+tree and B*-tree did...
> 
> Tanel.
> 
> ----- Original Message ----- 
> To: "Multiple recipients of list ORACLE-L" <ORACLE-L_at_fatcity.com>
> Sent: Friday, October 31, 2003 6:44 PM
> 
> 
> 


>>A B-tree is not a binary tree. A binary tree node has 0, 1, or 2

>>children. A B-tree is a multiway tree in which a node can have

>>arbitrarily many children.

>>

>>Oracle implements a thing that's similar to a B*-tree. A B*-tree is

>>structurally indistinguishable from a B-tree. They differ only in

>>properties of the insertion and deletion methods used to manipulate

>>them. For complete information, see Knuth's "The Art of Computer

>>Programming, Volume III: Sorting and Searching," pp473-480.

>>

>>

>>Cary Millsap

>>Hotsos Enterprises, Ltd.

>>http://www.hotsos.com

 >>


>>-----Original Message-----

>>Sinardy Xing

>>Sent: Thursday, October 30, 2003 10:39 PM

>>To: Multiple recipients of list ORACLE-L

>>

>>Hi Thai,

>>

>>B-tree is short for binary tree, Indexing method make use of Binary

>>search function to fast retrieve your records, therefore require sorted

>>records.

>>B+ tree (I don't know this one, never heard)

>>

>>Go to www.Oracle.com download the document for free.

>>

>>Reading order:

>>1. Concept

>>2. SQLPlus

>>3. DB Admin

>>4. Backup and Recovery

>>5. Network

>>

>>After you finish all of these you have basic skill, you can be an Oracle

>>DBA.

>>

>>

>>Good luck.

>>

>>Sinardy

>>

>>-----Original Message-----

>>Sent: 31 October 2003 11:49

>>To: Multiple recipients of list ORACLE-L

>>

>>

>>Hello all,

>>

>>I am looking for documents saying how Oracle uses file organizations

>>like B-tree, B+ tree, heap file, index file ..... in their database.

>>

>>If you know where I can get those documentations, could you let me know?

>>

>>Thank you.

>>

>>Thai



-- 
Please see the official ORACLE-L FAQ: http://www.orafaq.net
-- 
Author: Vladimir Begun
  INET: vladimir.begun_at_oracle.com

Fat City Network Services    -- 858-538-5051 http://www.fatcity.com
San Diego, California        -- Mailing list and web hosting services
---------------------------------------------------------------------
To REMOVE yourself from this mailing list, send an E-Mail message
to: ListGuru_at_fatcity.com (note EXACT spelling of 'ListGuru') and in
the message BODY, include a line containing: UNSUB ORACLE-L
(or the name of mailing list you want to be removed from).  You may
also send the HELP command for other information (like subscribing).