Re: order of nested loop

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Jean-Luc Lachance <jllachan(at)nsd(dot)ca>
Cc: Joseph Shraibman <joseph(at)xtenit(dot)com>, pgsql-general(at)postgresql(dot)org
Subject: Re: order of nested loop
Date: 2003-06-17 15:40:58
Message-ID: 13145.1055864458@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Jean-Luc Lachance <jllachan(at)nsd(dot)ca> writes:
> I am currious. Why perform a sort first? Would it not be more
> efficient to create an in memory index on the fly?

Why would you think that? Creating an index involves a sort ...
there's no free lunch there that I can see.

regards, tom lane

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Jean-Luc Lachance 2003-06-17 15:53:05 Re: order of nested loop
Previous Message Bruno Wolff III 2003-06-17 15:39:40 Re: adddepend and partial indexes