Horton

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

Tom Lane <tgl@sss.pgh.pa.us>

View thread
From: Tom Lane <tgl@sss.pgh.pa.us>
To: Robert Haas <robertmhaas@gmail.com>
Cc: Bruce Momjian <bruce@momjian.us>, Peter Geoghegan <peter@2ndquadrant.com>, Jay Levitt <jay.levitt@gmail.com>, "Jim Decibel! Nasby" <decibel@decibel.org>, PG Hackers <pgsql-hackers@postgresql.org>
Date: 2012-02-08T18:20:19Z
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 →

  1. During btree index build, sort equal-keyed tuples according to their

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