Re: Progress on fast path sorting, btree index creation time - Mailing list pgsql-hackers

From Tom Lane
Subject Re: Progress on fast path sorting, btree index creation time
Date
Msg-id 28439.1328725219@sss.pgh.pa.us
Whole thread Raw
In response to Re: Progress on fast path sorting, btree index creation time  (Robert Haas <robertmhaas@gmail.com>)
List pgsql-hackers
Robert Haas <robertmhaas@gmail.com> writes:
> [ lots of numbers ]

> ... I just can't get excited about that.  However, I
> find the single-key optimizations much more compelling, for the
> reasons stated above, and feel we ought to include those.

This conclusion seems sound to me, for the reasons you stated and one
more: optimizations for a single sort key are going to be applicable
to a very wide variety of queries, whereas all the other cases are
necessarily less widely applicable.
        regards, tom lane


pgsql-hackers by date:

Previous
From: Robert Haas
Date:
Subject: Re: Vacuum rate limit in KBps
Next
From: Robert Haas
Date:
Subject: Re: patch for parallel pg_dump