Re: Modyfication Sort Merge Join Alghoritm

From: Jeff Janes <jeff(dot)janes(at)gmail(dot)com>
To: tubadzin <tubadzin(at)o2(dot)pl>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Modyfication Sort Merge Join Alghoritm
Date: 2013-08-13 03:16:59
Message-ID: CAMkU=1yzKuDa9myroeokQ_vyn-v0X+O6O67+CgCdZ81=Fc2vjA@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Mon, Aug 12, 2013 at 1:31 PM, tubadzin <tubadzin(at)o2(dot)pl> 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.

What is a "g-join"? If you have a reference to that algorithm, it
would help clarify what you are asking.

Cheers,

Jeff

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Bruce Momjian 2013-08-13 03:31:38 Re: [BUGS] BUG #8335: trim() un-document behaviour
Previous Message Etsuro Fujita 2013-08-13 03:16:00 Re: WITH ORDINALITY planner improvements