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

From: Peter Geoghegan <peter(at)2ndquadrant(dot)com>
To: Bruce Momjian <bruce(at)momjian(dot)us>
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 22:49:10
Message-ID: CAEYLb_Vj-mRa12UrvLP2Q+4KTtPOHtqN0EWZ2gaeWuhj_OjwqQ@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

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.

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

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Jay Levitt 2012-02-06 23:25:33 semi-PoC: kNN-gist for cubes
Previous Message Jim "Decibel!" Nasby 2012-02-06 21:53:29 Re: Progress on fast path sorting, btree index creation time