Re: No merge sort?

From: "Ron Peacetree" <rjpeace(at)earthlink(dot)net>
To: pgsql-hackers(at)postgresql(dot)org
Subject: Re: No merge sort?
Date: 2003-04-08 03:11:26
Message-ID: y5rka.13518$ey1.1160132@newsread1.prod.itd.earthlink.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


"Ron Peacetree" <rjpeace(at)earthlink(dot)net> wrote in message
news:%cqka(dot)13403$ey1(dot)1154620(at)newsread1(dot)prod(dot)itd(dot)earthlink(dot)net(dot)(dot)(dot)
> <cbbrowne(at)cbbrowne(dot)com> wrote in message
> news:20030407202001(dot)1EC3C58E0D(at)cbbrowne(dot)com(dot)(dot)(dot)
> > It is highly likely that it will typically take more
> > computational effort to figure out that one of the 4 sorts
provided
> > /any/ improvement than any computational effort they would save.
> >
> > That's a /very/ common problem. There's also a fair chance, seen
in
> > practice, that the action of collecting additional statistics to
> improve
> > query optimization will cost more than the savings provided by the
> > optimizations.
> >
> "Back in the Day" I heard similar arguments when discussing whether
> there should be support for hashing [O(n)], interpolation search
TYPO ALERT: hashing is, of course, O(1)

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Nigel J. Andrews 2003-04-08 09:04:30 Casting
Previous Message Stephan Szabo 2003-04-08 02:13:24 Re: Backpatch FK changes to 7.3 and 7.2?