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 [EMAIL PROTECTED]
Sent: Friday, October 31, 2003 6:44 PM
A B-tree is not a
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.
Thanks, this is for my class project, not for my work :)
Have a good day.
- Original Message -
Date: Thursday, October 30, 2003 10:39 pm
Hi Thai,
B-tree is short for binary tree, Indexing method make use of Binary
search function to fast retrieve your records, therefore require
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
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:
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
