From: Jim C. Nasby <decibel@decibel.org>
To: PFC <lists@peufeu.com>
Cc: pgsql-performance@postgresql.org <pgsql-performance@postgresql.org>
Subject: Re: Feature suggestion : FAST CLUSTER
Date: Sun, 27 May 2007 10:53:38 -0500
Message-ID: <20070527155338.GM92628@nasby.net> (raw)
In-Reply-To: <op.tspwemefcigqcu@apollo13>
References: <op.tspwemefcigqcu@apollo13>
On Tue, May 22, 2007 at 09:29:00AM +0200, PFC wrote:
> This does not run a complete sort on the table. It would be about as
> fast as your seq scan disk throughput. Obviously, the end result is not as
> good as a real CLUSTER since the table will be made up of several ordered
> chunks and a range lookup. Therefore, a range lookup on the clustered
> columns would need at most N seeks, versus 1 for a really clustered table.
> But it only scans the table once and writes it once, even counting index
> rebuild.
Do you have any data that indicates such an arrangement would be
substantially better than less-clustered data?
--
Jim Nasby decibel@decibel.org
EnterpriseDB http://enterprisedb.com 512.569.9461 (cell)
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-performance@postgresql.org
Cc: decibel@decibel.org, lists@peufeu.com
Subject: Re: Feature suggestion : FAST CLUSTER
In-Reply-To: <20070527155338.GM92628@nasby.net>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox