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: Peter Geoghegan <peter@2ndquadrant.com>
Cc: Robert Haas <robertmhaas@gmail.com>, Noah Misch <noah@leadboat.com>, Jay Levitt <jay.levitt@gmail.com>, Jim Decibel! Nasby <decibel@decibel.org>, Tom Lane <tgl@sss.pgh.pa.us>, PG Hackers <pgsql-hackers@postgresql.org>
Date: 2012-02-09T17:16:20Z
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 Thu, Feb 09, 2012 at 03:36:23PM +0000, Peter Geoghegan wrote:
> On 9 February 2012 14:51, Robert Haas <robertmhaas@gmail.com> wrote:
> > I'm not sure I entirely follow all this, but I'll look at the code
> > once you have it.  Are you saying that all the comparetup_yadda
> > functions are redundant to each other in the single-key case?
> 
> Yes, I am. The main reason that the loops exist in those functions
> (which is the only way that they substantially differ) is because they
> each have to get the other keys through various ways that characterise
> the tuple class that they encapsulate (index_getattr(),
> heap_getattr(), etc).

Does this help all types for sorting, including strings?

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

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