On Mon, Aug 12, 2013 at 08:16:59PM -0700, Jeff Janes wrote:
> On Mon, Aug 12, 2013 at 1: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
On Mon, Aug 12, 2013 at 1: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 t
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 ou
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.
Is it difficult to i
