Re: Planning aggregates which require sorted or distinct

From: Gavin Sherry <swm(at)alcove(dot)com(dot)au>
To: Gregory Stark <stark(at)enterprisedb(dot)com>
Cc: Simon Riggs <simon(at)2ndquadrant(dot)com>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Planning aggregates which require sorted or distinct
Date: 2007-01-20 13:57:40
Message-ID: Pine.LNX.4.58.0701210056380.30027@linuxworld.com.au
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Sat, 20 Jan 2007, Gregory Stark wrote:

> However for RANGE UNBOUNDED PRECEDING we can apply a different plan. Keep the
> state variable for each window aggregate around for the entire time. For each
> record apply the state transition function then apply the FINAL function to
> generate the result for that record but keep the state variable as it was for
> the next record.

Yes, I made reference to this case else where in the email (or was it a
different email in the thread?).

Thanks,

Gavin

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Simon Riggs 2007-01-20 14:20:11 Re: Planning aggregates which require sorted or distinct
Previous Message Gregory Stark 2007-01-20 13:48:25 Re: Planning aggregates which require sorted or distinct