Hi Sinardy,
one little correction: you forgot the winking smiley
at the end of your last sentence ;-)
Greetings,
Guido
[EMAIL PROTECTED] 31.10.2003 05.39 Uhr
Hi Thai,
B-tree is short for binary tree, Indexing method make use of Binary search function to
fast retrieve your records,
No I am serious
-Original Message-
[mailto:[EMAIL PROTECTED]
Sent: 31 October 2003 14:49
To: Multiple recipients of list ORACLE-L
Hi Sinardy,
one little correction: you forgot the winking smiley
at the end of your last sentence ;-)
Greetings,
Guido
[EMAIL PROTECTED] 31.10.2003
A B-Tree is not a binary structure, but an n-ary one. A true binary tree bifurcates,
By that I mean
Root node A connects to branch nodes C and D, Branch node C connects to branch nodes
E and F. Branch Node D connects to branch nodes G and H and so forth. Each node is
directly connected to
