Re: Suggestions for first exam ...

Not really my area, but I think you'll
find that a B*tree is supposed to increase the average loading of the leaf nodes by sharing data across blocks sometimes
rather than demanding a new block
whenever a block gets filled to overflowing.

In which case, Oracle does not use B*,
whatever it says in the manual..

--
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


One-day tutorials:
http://www.jlcomp.demon.co.uk/tutorial.html

____Finland__September 22nd - 24th
____Norway___September 25th - 26th
____UK_______December (UKOUG conference)

Three-day seminar:
see http://www.jlcomp.demon.co.uk/seminar.html
____USA__October
____UK___November


The Co-operative Oracle Users' FAQ
http://www.jlcomp.demon.co.uk/faq/ind_faq.html


"Howard J. Rogers" <howardjr2000_at_yahoo.com.au> wrote in message
news:3f763087$0$10617$afc38c87_at_news.optusnet.com.au...


> Noons wrote:

>

> > es, which are different. Sort of.

> >

> > Hehehe!  Good point.  The pdf claims they were using b-trees,

> > but you're quite right: I remember seeing it written somewhere

> > in one of the concepts manuals, ages ago.

>

> Oh, I think the difference is pretty minor, technically. Whatever a

 b-tree


> is, a b+tree is a b-tree that provides one-way sequential linking of

 leaf


> nodes so that ascending index scans are easy. And a b*tree is a

 b-tree that


> provides two-way linking of leaf nodes, so that index scans up or

 down are


> easy. But the 'b' still stands for whatever it stood for in either

 case...


> which could be balanced, bayer or binary. Or 'bloody hell what a

 pointless


> discussion'!!

>

> ;-)

> HJR