From: | Bruno Wolff III <bruno(at)wolff(dot)to> |
---|---|
To: | nikolay(at)samokhvalov(dot)com |
Cc: | pgsql-general(at)postgresql(dot)org |
Subject: | Re: Wish: remove ancient constructs from Postgres |
Date: | 2006-02-27 18:54:22 |
Message-ID: | 20060227185422.GA28115@wolff.to |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
On Mon, Feb 27, 2006 at 18:34:16 +0300,
Nikolay Samokhvalov <samokhvalov(at)gmail(dot)com> wrote:
> On 2/27/06, Bruno Wolff III <bruno(at)wolff(dot)to> wrote:
> > The alternatives to distinct on are painful. They are generally both harder
> > to read and run slower.
> >
>
> 'DISTINCT ON' is evil constuction, because (w/o any 'ORDER BY') it
> produses unpredictable result, as 'ORDER BY random()' does.
>
> When newbie types 'random()', he understands what he is doing, but
> it's not the case for 'DISTINCT ON' and can lead to mistakes.
The documentation for DISTINCT ON is clear about this:
DISTINCT ON ( expression [, ...] ) keeps only the first row of each set of rows where the given expressions evaluate to equal. The DISTINCT ON expressions are interpreted using the same rules as for ORDER BY (see above). Note that the "first row" of each set is unpredictable unless ORDER BY is used to ensure that the desired row appears first. For example,
I doubt the newbie understands random() as well as DISTINCT ON on the first
go around. In some uses random() is evaluated per tuple and in others it isn't.
In particular it probably isn't obvious to newbies what the semantics of the
following is:
SELECT a FROM b WHERE a > random();
From | Date | Subject | |
---|---|---|---|
Next Message | Bernhard Weisshuhn | 2006-02-27 19:05:55 | Re: ltree + gist index performance degrades significantly over a night |
Previous Message | Volkan YAZICI | 2006-02-27 18:41:52 | Breaking Path/Polygon Data into Pieces |