Re: Hash Index Build Patch

From: Alvaro Herrera <alvherre(at)commandprompt(dot)com>
To: Tom Raney <twraney(at)comcast(dot)net>
Cc: pgsql-patches(at)postgresql(dot)org
Subject: Re: Hash Index Build Patch
Date: 2007-09-26 12:49:45
Message-ID: 20070926124945.GE5584@alvh.no-ip.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-patches

Hi Tom,

Tom Raney wrote:

> We used spool functions from the BTree code to sort the index
> tuples. Sorting is done on the hash value of the tuples. The hash
> value depends on the number of primary bucket pages (henceforth
> just bucket pages) that will be required to fit all the index
> tuples. So, before sorting, the base relation is scanned to get
> the total number of tuples.

Just wondering, wouldn't it be enough to obtain a tuple count estimate
by using reltuples / relpages * RelationGetNumberOfBlocks, like the
planner does?

--
Alvaro Herrera http://www.CommandPrompt.com/
The PostgreSQL Company - Command Prompt, Inc.

In response to

Responses

Browse pgsql-patches by date

  From Date Subject
Next Message Tom Lane 2007-09-26 18:54:36 Re: Optimizer hook
Previous Message Michael Meskes 2007-09-26 10:57:27 Re: Thread-safe PREPARE in ecpg