Re: Progress on fast path sorting, btree index creation time

Peter Geoghegan <peter@2ndquadrant.com>

From: Peter Geoghegan <peter@2ndquadrant.com>

To: Robert Haas <robertmhaas@gmail.com>

Cc: Bruce Momjian <bruce@momjian.us>, Tom Lane <tgl@sss.pgh.pa.us>, Jay Levitt <jay.levitt@gmail.com>, "Jim Decibel! Nasby" <decibel@decibel.org>, PG Hackers <pgsql-hackers@postgresql.org>

Date: 2012-02-08T19:50:18Z

Lists: pgsql-hackers

Commits

Same data as JSON: GET /api/v1/messages/:b64id/commits the thread's linked commits as JSON, with link sources. API reference →

During btree index build, sort equal-keyed tuples according to their
- fbac1272b89b 8.0.0 cited

On 8 February 2012 18:48, Peter Geoghegan <peter@2ndquadrant.com> wrote:
> I think that there may be additional benefits from making the
> qsort_arg specialisation look less like a c stdlib one, like refining
> the swap logic to have compile-time knowledge of the type it is
> sorting. I'm thinking that we could usefully trim quite a bit from
> this:

It seems like while we cannot get any better performance, no doubt
because the code is already using all manner of optimisations,
including perhaps constant propagation, we can simplify this part of
the code quite a bit. That seems fairly incidental though.

-- 
Peter Geoghegan       http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training and Services