From: | Robert Haas <robertmhaas(at)gmail(dot)com> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | Daniel Grace <dgrace(at)wingsnw(dot)com>, pgsql-hackers(at)postgresql(dot)org, Hitoshi Harada <umi(dot)tanuki(at)gmail(dot)com> |
Subject: | Re: Parsing of aggregate ORDER BY clauses |
Date: | 2010-07-27 23:38:39 |
Message-ID: | AANLkTik+Btrc9NTucJZsdUf6LaRPjdFrUtJmpgCvvmH6@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Tue, Jul 27, 2010 at 7:16 PM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
> Daniel Grace <dgrace(at)wingsnw(dot)com> writes:
>> But if we SELECT
>> SOME_INTEGER_AGGREGATE(DISTINCT floatcol ORDER BY floatcol), should
>> the DISTINCT operate on floatcol (i.e. 1.1 and 1.2 are distinct, even
>> if it means the function is called with '1' twice) or
>> floatcol::integer (1.1 and 1.2 are not distinct)?
>
> Yes. The current implementation has the advantage that any
> unique-ifying step is guaranteed to produce outputs that are distinct
> from the point of view of the aggregate function, whereas if we try to
> keep the two operations at arms-length, then either we lose that
> property or we sort-and-unique twice :-(.
Am I misreading this, or did you just answer an "either-or" question with "yes"?
--
Robert Haas
EnterpriseDB: http://www.enterprisedb.com
The Enterprise Postgres Company
From | Date | Subject | |
---|---|---|---|
Next Message | Robert Haas | 2010-07-27 23:41:29 | Re: Review: Re: [PATCH] Re: [HACKERS] Adding xpath_exists function |
Previous Message | David Fetter | 2010-07-27 23:33:25 | Review: Re: [PATCH] Re: [HACKERS] Adding xpath_exists function |