| From: | Adam Lee <ali(at)pivotal(dot)io> |
|---|---|
| To: | Tomas Vondra <tomas(dot)vondra(at)2ndquadrant(dot)com> |
| Cc: | Jeff Davis <pgsql(at)j-davis(dot)com>, Melanie Plageman <melanieplageman(at)gmail(dot)com>, Heikki Linnakangas <hlinnaka(at)iki(dot)fi>, Taylor Vesely <tvesely(at)pivotal(dot)io>, Melanie Plageman <mplageman(at)pivotal(dot)io>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Memory-Bounded Hash Aggregation |
| Date: | 2020-02-20 04:04:37 |
| Message-ID: | 20200220040437.GA4389@earth.local |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Wed, Feb 19, 2020 at 08:16:36PM +0100, Tomas Vondra wrote:
> 4) lookup_hash_entries says
>
> /* check to see if we need to spill the tuple for this grouping set */
>
> But that seems bogus, because AFAIK we can't spill tuples for grouping
> sets. So maybe this should say just "grouping"?
As I see it, it does traverse all hash sets, fill the hash table and
spill if needed, for each tuple.
The segfault is probably related to this and MixedAggregate, I'm looking
into it.
--
Adam Lee
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Andres Freund | 2020-02-20 04:14:02 | Re: Improve heavyweight locks instead of building new lock managers? |
| Previous Message | Thomas Munro | 2020-02-20 03:55:12 | Experimenting with transactional memory for SERIALIZABLE |