Re: non-WAL btree?

From: "Francisco Reyes" <lists(at)stringsutils(dot)com>
To: Alex Vinogradovs <AVinogradovs(at)Clearpathnet(dot)com>
Cc: <jd(at)commandprompt(dot)com>, <pgsql-general(at)postgresql(dot)org>, <david(dot)t(dot)wilson(at)gmail(dot)com>
Subject: Re: non-WAL btree?
Date: 2008-08-01 20:50:21
Message-ID: ead3b0cfd7c4e934e24e601b706e9355@stringsutils.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On 4:36 pm 08/01/08 Alex Vinogradovs <AVinogradovs(at)Clearpathnet(dot)com> wrote:
> It's not that I expect a lot of improvement by having non-WAL
> indexing

Have you tried using a fill factor less than 90%?
That is on my list of things to test, but have not done yet.. In particular
you need to find a balance where the speed gained justifies the increase in
size of the index.. and the potential slowdowns because of larger indexes.

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Jaime Casanova 2008-08-01 21:38:21 Re: non-WAL btree?
Previous Message Alex Vinogradovs 2008-08-01 20:36:40 Re: non-WAL btree?