Re: Modyfication Sort Merge Join Alghoritm

From: Josh Berkus <josh(at)agliodbs(dot)com>
To: pgsql-hackers(at)postgresql(dot)org
Subject: Re: Modyfication Sort Merge Join Alghoritm
Date: 2013-08-12 22:05:03
Message-ID: 52095C0F.5000605@agliodbs.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 08/12/2013 01:31 PM, tubadzin wrote:
> Hi users.
> I want to sure, that is no this implementation in Postgresql:
> For Sorte Merge Join Alghoritm:
> If the large input arrives sorted,
> g-join joins its pages with the buffer pool contents by strictly
> increasing join key values and the join output is also strictly
> sorted.

I'm not quite sure what you're asking. We have a merge sort already,
and AFAIK it doesn't resort the input if it was sorted in an earlier step.

--
Josh Berkus
PostgreSQL Experts Inc.
http://pgexperts.com

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Greg Stark 2013-08-12 22:18:18 Re: killing pg_dump leaves backend process
Previous Message Bruce Momjian 2013-08-12 21:19:30 Re: [BUGS] BUG #8335: trim() un-document behaviour