Re: Re: custom hash-based COUNT(DISTINCT) aggregate - unexpectedly high memory consumption

From: Claudio Freire <klaussfreire(at)gmail(dot)com>
To: Atri Sharma <atri(dot)jiit(at)gmail(dot)com>
Cc: Tomas Vondra <tv(at)fuzzy(dot)cz>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Re: custom hash-based COUNT(DISTINCT) aggregate - unexpectedly high memory consumption
Date: 2013-10-08 05:11:25
Message-ID: CAGTBQpbRg4tabkvEFu2gb=Aiv67uhnHzYsMgykTArGeTxRKQpw@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Tue, Oct 8, 2013 at 1:23 AM, Atri Sharma <atri(dot)jiit(at)gmail(dot)com> wrote:
>>> Consider the aspects associated with open addressing.Open addressing
>>> can quickly lead to growth in the main table.Also, chaining is a much
>>> cleaner way of collision resolution,IMHO.
>>
>> What do you mean by "growth in the main table"?
>
> Sorry, I should have been more verbose.
>
> AFAIK, Open addressing can be slower with a load factor approaching 1
> as compared to chaining. Also, I feel that implementation of open
> addressing can be more complicated as we have to deal with deletes
> etc.

Deletes for a hash aggregate?

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message David Fetter 2013-10-08 06:16:56 CREATE FOREIGN TABLE ( ... LIKE ... )
Previous Message KONDO Mitsumasa 2013-10-08 04:25:30 Re: pgsql: docs: update release notes for 8.4.18, 9.0.14, 9.1.10, 9.2.5, 9