Re: OLAP CUBE/ROLLUP Operators and GROUP BY grouping sets

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Hannu Krosing <hannu(at)tm(dot)ee>
Cc: Robert Bedell <robert(at)friendlygenius(dot)com>, "pgsql-hackers(at)postgresql(dot)org" <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: OLAP CUBE/ROLLUP Operators and GROUP BY grouping sets
Date: 2003-12-18 01:20:03
Message-ID: 15837.1071710403@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Hannu Krosing <hannu(at)tm(dot)ee> writes:
> OTOH, I'm not sure if hash aggregates can already spill to disk if not
> enough memory is available for keeping them all.

They do not, which is something it'd be good to fix, since if the
planner drastically underestimates the number of groups, you could end
up with a hashtable far bigger than the advertised SortMem. Even if
this doesn't end up with an "out of memory" error, it could still drive
you into swap hell.

(Maybe that should be Robert's get-your-feet-wet project.)

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2003-12-18 01:30:11 Re: Limiting per user and per db accesse (was TODO list)
Previous Message Tom Lane 2003-12-18 01:10:25 Re: TODO list