Re: Reverse order indexes in Oracle8

From: <dejanews_at_datagen.com>
Date: Thu, 15 Apr 1999 17:28:37 GMT
Message-ID: <7f57jp$rqk$1@nnrp1.dejanews.com>

In article <370E1DD4.D708BD05_at_us.oracle.com>, Pete Sharman <psharman_at_us.oracle.com> wrote: >
> Both the answers to this question left out one vital part. Reverse-key
indexes
> work the way stated in earlier responses, but the problem occurs when a
> monotonically increasing sequence number index splits to the right AND there
is
> little delete activity. The reason the extra bit is important is that if we
delete
> all the entries for an index block, there is some rebalancing of the index
tree
> that takes place automatically. If there is no delete activity, then we just
keep
> splitting the B-tree to the right for normal indexes. In a reverse key index
the
> values are changing more randomly if you like to think of it that way, so you
get a
> more balanced index.

What exactly is a B-tree split?

Sergey

-----------== Posted via Deja News, The Discussion Network ==---------- http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own Received on Thu Apr 15 1999 - 12:28:37 CDT