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

From: Bruce Momjian <bruce(at)momjian(dot)us>
To: Peter Geoghegan <peter(at)2ndquadrant(dot)com>
Cc: Robert Haas <robertmhaas(at)gmail(dot)com>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, PG Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Progress on fast path sorting, btree index creation time
Date: 2012-02-06 23:43:04
Message-ID: 20120206234304.GI19450@momjian.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Mon, Feb 06, 2012 at 10:49:10PM +0000, Peter Geoghegan wrote:
> On 6 February 2012 21:19, Bruce Momjian <bruce(at)momjian(dot)us> wrote:
> > Peter Geoghegan obviously has done some serious work in improving
> > sorting, and worked well with the community process.
>
> Thank you for acknowledging that.
>
> It's unfortunate that C does not support expressing these kinds of
> ideas in a more natural way.

Yes, it is a problem, and a benefit. We have avoided C++ because these
types of trade-offs that we are discussing are often done invisibly, so
we can't make the decision ourselves.

--
Bruce Momjian <bruce(at)momjian(dot)us> http://momjian.us
EnterpriseDB http://enterprisedb.com

+ It's impossible for everything to be true. +

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Charlie 2012-02-07 00:01:56 Re: \copy: unexpected response (4)
Previous Message Jay Levitt 2012-02-06 23:25:33 semi-PoC: kNN-gist for cubes