Skip site navigation (1) Skip section navigation (2)

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

From: Bruce Momjian <bruce(at)momjian(dot)us>
To: Peter Geoghegan <peter(at)2ndquadrant(dot)com>
Cc: Robert Haas <robertmhaas(at)gmail(dot)com>, Noah Misch <noah(at)leadboat(dot)com>,Jay Levitt <jay(dot)levitt(at)gmail(dot)com>,Jim Decibel! Nasby <decibel(at)decibel(dot)org>,Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>,PG Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Progress on fast path sorting, btree index creation time
Date: 2012-02-09 17:16:20
Message-ID: 20120209171620.GA22355@momjian.us (view raw or flat)
Thread:
Lists: pgsql-hackers
On Thu, Feb 09, 2012 at 03:36:23PM +0000, Peter Geoghegan wrote:
> On 9 February 2012 14:51, Robert Haas <robertmhaas(at)gmail(dot)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(at)momjian(dot)us>        http://momjian.us
  EnterpriseDB                             http://enterprisedb.com

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

In response to

Responses

pgsql-hackers by date

Next:From: Robert HaasDate: 2012-02-09 17:25:17
Subject: Re: Add protransform for numeric, varbit, and temporal types
Previous:From: Robert HaasDate: 2012-02-09 17:02:29
Subject: index-only quals vs. security_barrier views

Privacy Policy | About PostgreSQL
Copyright © 1996-2013 The PostgreSQL Global Development Group