Re: Progress on fast path sorting, btree index creation time - Mailing list pgsql-hackers

From Peter Geoghegan
Subject Re: Progress on fast path sorting, btree index creation time
Date
Msg-id CAEYLb_Vc0ovDG+3vghF0ZeiCs1qAMBbZ9f4eG62mp=pnFHGGcA@mail.gmail.com
Whole thread Raw
In response to Re: Progress on fast path sorting, btree index creation time  (Robert Haas <robertmhaas@gmail.com>)
Responses Re: Progress on fast path sorting, btree index creation time  (Bruce Momjian <bruce@momjian.us>)
List pgsql-hackers
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).

--
Peter Geoghegan       http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training and Services


pgsql-hackers by date:

Previous
From: Tom Lane
Date:
Subject: Re: [COMMITTERS] pgsql: Add new keywords SNAPSHOT and TYPES to the keyword list in gram.
Next
From: "Kevin Grittner"
Date:
Subject: Notify system doesn't recover from "No space" error