Re: non-WAL btree?

From: Alex Vinogradovs <AVinogradovs(at)Clearpathnet(dot)com>
To: Joshua Drake <jd(at)commandprompt(dot)com>
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: non-WAL btree?
Date: 2008-08-01 20:07:18
Message-ID: 1217621238.79373.53.camel@localhost
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

By loading in bulks, I mean I load some 40-50 thousand
rows at once into a table that already has some millions.
Index rebuild on that table after each 50k inserts will
be even less efficient ;)

Alex.

On Fri, 2008-08-01 at 12:57 -0700, Joshua Drake wrote:
> On Fri, 01 Aug 2008 12:41:12 -0700
> Alex Vinogradovs <AVinogradovs(at)Clearpathnet(dot)com> wrote:
>
> > Guys,
> >
> > I was wondering if there is a btree indexing implementation that
> > is not WAL-logged. I'm loading data in bulks, and index logging
> > is an unnecessary overhead for me (easier to rebuild on crash).
>
> Drop the index during load?
>
> >
> > Thanks!
> >
> > best regards,
> > Alex Vinogradovs
> >
>
>

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message David Wilson 2008-08-01 20:16:19 Re: non-WAL btree?
Previous Message Joshua Drake 2008-08-01 19:57:29 Re: non-WAL btree?