| From: | Russell Smith <mr-russ(at)pws(dot)com(dot)au> |
|---|---|
| To: | "Surabhi Ahuja " <surabhi(dot)ahuja(at)iiitb(dot)ac(dot)in> |
| Cc: | pgsql-general(at)postgresql(dot)org |
| Subject: | Re: bulk loading of bplus index tree |
| Date: | 2005-05-26 08:30:26 |
| Message-ID: | 200505261830.26461.mr-russ@pws.com.au |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
On Thu, 26 May 2005 06:06 pm, Surabhi Ahuja wrote:
>
> I have heard about "bulk loading algorithm" for indexes..
> for eg. if u have values like 1, 2,3,4,5, etc...till a very large number.
> in case of simple mechanism of indexing, the values will be inserted one by one for eg..1 then 2 and so on
> however in bulk loading ..the mechanism of building the index (bplus)tree is quite diffreent and very fast ezpecially if u consider a very large number of values.
>
> My question is : is this algorith implemented by postgreSQL. If yes please tell in what cases can i make use of it.
Bulk loading for B+Tree's in implemented in PostgreSQL. It is used on index creation, or reindex.
I don't believe it's in other places, but Others may have more to say.
Regards
Russell Smith.
> Thank You
> Regards
> Surabhi Ahuja
>
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Bucks vs Bytes Inc | 2005-05-26 10:59:43 | Re: unsupported frontend protocol |
| Previous Message | Surabhi Ahuja | 2005-05-26 08:06:01 | bulk loading of bplus index tree |