Re: A new proof of the superiority of set oriented approaches: numerical/time serie linear interpolation
From: DBMS_Plumber <paul_geoffrey_brown_at_yahoo.com>
Date: 1 May 2007 13:31:58 -0700
Message-ID: <1178051518.021734.303210_at_q75g2000hsh.googlegroups.com>
Date: 1 May 2007 13:31:58 -0700
Message-ID: <1178051518.021734.303210_at_q75g2000hsh.googlegroups.com>
On Apr 30, 4:42 am, "David Cressey" <cresse..._at_verizon.net> wrote:
> Meanwhile, my technical counterparts on the programming side were objecting
> to
>
> select ... group by A, B order by A, B
>
> because, according to them, the order by clause was redundant, and
> therefore a waste of time.
My.
Won't they be surprised when they meet partitioning algorithms that use hashing! Received on Tue May 01 2007 - 22:31:58 CEST