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: Bruce Momjian <bruce@momjian.us>
Cc: Robert Haas <robertmhaas@gmail.com>, 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-08T16:35:46Z
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

Bruce Momjian <bruce@momjian.us> writes:
> Yes, please.  That would be a big help.   Is there no optimization for
> strings?  I assume they are sorted a lot.  

It seems unlikely that it'd be worth including strings, especially if
your locale is not C.  This whole thing only makes sense for datatypes
that are comparable in approximately 1 machine instruction.

			regards, tom lane