Re: [HACKERS] choose_bitmap_and again (was Re: Strangely Variable Query Performance) - Mailing list pgsql-performance

From Tom Lane
Subject Re: [HACKERS] choose_bitmap_and again (was Re: Strangely Variable Query Performance)
Date
Msg-id 4535.1176565965@sss.pgh.pa.us
Whole thread Raw
In response to Re: Strangely Variable Query Performance  (Steve <cheetah@tanabi.org>)
List pgsql-performance
"Dann Corbit" <DCorbit@connx.com> writes:
> Instead of sorting, I suggest the quickselect() algorithm, which is
> O(n).

What for?  Common cases have less than half a dozen entries.  That is
not the place we need to be spending engineering effort --- what we
need to worry about is what's the choice algorithm, not implementation
details.

            regards, tom lane

pgsql-performance by date:

Previous
From: Bill Moran
Date:
Subject: Re: Basic Q on superfluous primary keys
Next
From: Tom Lane
Date:
Subject: Re: Question about memory allocations