Path: news.easynews.com!newsfeed1.easynews.com!easynews.com!easynews!c03.atl99!news.webusenet.com!newsfeed.icl.net!newsfeed.fjserv.net!colt.net!kibo.news.demon.net!news.demon.co.uk!demon!not-for-mail
From: "Jonathan Lewis" <jonathan@jlcomp.demon.co.uk>
Newsgroups: comp.databases.oracle.server
Subject: Re: index rebuilding...
Date: Sun, 2 Feb 2003 09:55:02 -0000
Lines: 47
Message-ID: <b1ipul$gtj$1$8300dec7@news.demon.co.uk>
References: <o%WZ9.61302$c41.1415158@news2.telusplanet.net> <v3ghe8qj8vstf4@corp.supernews.com> <3EXZ9.53855$GX4.2199677@news2.east.cox.net> <m%e_9.36861$jM5.93877@newsfeeds.bigpond.com> <3E39A86C.3143C919@exesolutions.com> <69f6c1c8.0301301921.143657e6@posting.google.com> <998d28f7.0301310721.3c724ec@posting.google.com> <b1e710$sqa$1$8300dec7@news.demon.co.uk> <3E3AAC94.B8B6073C@exesolutions.com> <6By_9.37587$jM5.94689@newsfeeds.bigpond.com> <slrnb3plsp.3ds.hjp-usenet@teal.hjp.at>
NNTP-Posting-Host: jlcomp.demon.co.uk
X-Trace: news.demon.co.uk 1044179734 17331 158.152.75.41 (2 Feb 2003 09:55:34 GMT)
X-Complaints-To: abuse@demon.net
NNTP-Posting-Date: Sun, 2 Feb 2003 09:55:34 +0000 (UTC)
X-MIMEOLE: Produced By Microsoft MimeOLE V4.72.3110.3
X-Newsreader: Microsoft Outlook Express 4.72.3110.5
Xref: newsfeed1.easynews.com comp.databases.oracle.server:174501
X-Received-Date: Sun, 02 Feb 2003 02:54:53 MST (news.easynews.com)


Of course, this does mean that Oracle doesn't
use B*Trees, as it's manuals have claimed since
at least 5.1 - it uses a version of B+trees.

Correct me if I'm wrong, but aren't B*trees supposed
to redistribute leaf entries to adjacent blocks without
doing a split if certain conditions are met - and this is
something that Oracle never does.

--
Regards

Jonathan Lewis
http://www.jlcomp.demon.co.uk

Coming soon a new one-day tutorial:
Cost Based Optimisation
(see http://www.jlcomp.demon.co.uk/tutorial.html )

____UK_______March 19th
____USA_(FL)_May 2nd


Next Seminar dates:
(see http://www.jlcomp.demon.co.uk/seminar.html )

____USA_(CA, TX)_August


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


Peter J. Holzer wrote in message ...
>
>B+trees push all the data down to the leaf nodes and keep only
pointers
>to other nodes in the higher level nodes.
>
>B*trees are like b+trees, but use a modified split algorithm to keep
the
>nodes at least 2/3 filled.
>



