Horton

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

Bruce Momjian <bruce@momjian.us>

View thread
From: Bruce Momjian <bruce@momjian.us>
To: Tom Lane <tgl@sss.pgh.pa.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:37:23Z
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

On Wed, Feb 08, 2012 at 11:35:46AM -0500, Tom Lane wrote:
> 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.

Ah, OK, interesting.

-- 
  Bruce Momjian  <bruce@momjian.us>        http://momjian.us
  EnterpriseDB                             http://enterprisedb.com

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