Tom,
Thanks for your comments and for your work incorporating our patch into
8.4. This will help us provide even a better patch next time around :)
-Shreya Bhargava and Tom Raney
Tom Raney <[EMAIL PROTECTED]> writes:
This revised version of our patch uses the function estimate_rel_size()
Tom Raney <[EMAIL PROTECTED]> writes:
> This revised version of our patch uses the function estimate_rel_size()
> from plancat.c to estimate the number of tuples in the parent relation.
> This method is an alternative to scanning the parent relation to
> estimate the number of tuples, as we did
This has been saved for the 8.4 release:
http://momjian.postgresql.org/cgi-bin/pgpatches_hold
---
Tom Raney wrote:
> This revised version of our patch uses the function estimate_rel_size()
> from plancat.c to estim
This revised version of our patch uses the function estimate_rel_size()
from plancat.c to estimate the number of tuples in the parent relation.
This method is an alternative to scanning the parent relation to
estimate the number of tuples, as we did in the first version of the patch.
-Tom
#in
This has been saved for the 8.4 release:
http://momjian.postgresql.org/cgi-bin/pgpatches_hold
---
Tom Raney wrote:
> Hello All,
>
> We have prepared a patch (against CVS HEAD)for the TODO item:
> * Hash
>-Durin
On Wed, 2007-09-26 at 16:06 -0400, Tom Lane wrote:
> Tom Raney <[EMAIL PROTECTED]> writes:
> > Alvaro Herrera wrote:
> >> Just wondering, wouldn't it be enough to obtain a tuple count estimate
> >> by using reltuples / relpages * RelationGetNumberOfBlocks, like the
> >> planner does?
>
> > We thou
Tom Raney <[EMAIL PROTECTED]> writes:
> Alvaro Herrera wrote:
>> Just wondering, wouldn't it be enough to obtain a tuple count estimate
>> by using reltuples / relpages * RelationGetNumberOfBlocks, like the
>> planner does?
> We thought of that and the verdict is still out whether it is more
> co
Alvaro Herrera wrote:
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
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.
Hello All,
We have prepared a patch (against CVS HEAD)for the TODO item:
* Hash
-During index creation, pre-sort the tuples to improve build speed
http://archives.postgresql.org/pgsql-hackers/2007-03/msg01199.php
Details of this patch's performance improvements can be found at
http://web
10 matches
Mail list logo