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:32:23
Message-ID: 1217622743.79373.55.camel@localhost
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Isn't hash indexing implementation non-WAL ?

Alex.

On Fri, 2008-08-01 at 13:16 -0700, Joshua Drake wrote:
> On Fri, 01 Aug 2008 13:07:18 -0700
> Alex Vinogradovs <AVinogradovs(at)Clearpathnet(dot)com> wrote:
>
> > 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 ;)
>
> Fair enough, to answer your question, "no". We don't have any non wal
> table tables or index types.
>
> Sincerely,
>
> Joshua D. Drake

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Alex Vinogradovs 2008-08-01 20:36:40 Re: non-WAL btree?
Previous Message David Wilson 2008-08-01 20:18:49 Re: non-WAL btree?