Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> c.d.o.misc -> Re: b-tree

Re: b-tree

From: Dan Clamage <clamage_at_mime.dw.lucent.com>
Date: 1997/10/29
Message-ID: <01bce43f$33fa5e50$54110b87@clamagent>#1/1

We had this discussion last month about whether Oracle uses a balanced B*Tree algorithm, and what several DBAs told me in their experience, after a lot of inserts access time dropped significantly (while with balanced B*trees you'd expect it to remain fairly constant or linear). -djc

Norbert Ferstl <ferstl_at_netway.at> wrote in article <345720E7.DBCDB25D_at_netway.at>...
> > any information about b-tree in oracle would help.
> > basically just trying to understand its function in oracle.
> In my opinion Oracle uses B*-trees
Received on Wed Oct 29 1997 - 00:00:00 CST

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US