Re: B-Tree and oracle question...maybe a tough question
From: mark <mark_brehmen_at_yahoo.com>
Date: 14 Aug 2001 21:22:42 -0700
Message-ID: <fa4781e4.0108142022.59c4c4fa_at_posting.google.com>
Date: 14 Aug 2001 21:22:42 -0700
Message-ID: <fa4781e4.0108142022.59c4c4fa_at_posting.google.com>
"DCCoolBreeze" <aa_at_bb.net> wrote in message news:<9l9snq$5nl$1_at_bob.news.rcn.net>...
> I have an unusual question. As . Given my rudimentary understanding of B-Tree, would there
> not be a time where it will basically take the same amount of time to insert
> a record regardless of the number of existing records in the table?
>
> I will actually be working with a billion records so I want to know how long
> it will take to insert a record into a table with this number of indexed
> records. I know that I could load that number of records and time the
> inserts but I currently do not have the facilities to do this...
>
> Any help???
Received on Wed Aug 15 2001 - 06:22:42 CEST