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

On Mon, Feb 06, 2012 at 06:43:04PM -0500, Bruce Momjian wrote:
> 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.

Let me add that while it is fine for languages like C++ to make these
decisions for application code automatically, operating systems and
high-performance databases developers prefer to make such decisions
explicitly, which is what we are discussing now.

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

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