pg.ddx.io  pgsql-sql@postgresql.org mailing list archive  
help / color / mirror / Atom feed
From: Stuart Rison <rison@biochemistry.ucl.ac.uk>
To: Bruce Momjian <maillist@candle.pha.pa.us>
Cc: Stuart Rison <rison@biochemistry.ucl.ac.uk>
Cc: Tom Lane <tgl@sss.pgh.pa.us>
Cc: Daniel Lopez <ridruejo@atm9.com.dtu.dk>
Cc: pgsql-sql@hub.org
Subject: Re: [SQL] Subselect performance
Date: Tue, 21 Sep 1999 16:55:23 +0100 (BST)
Message-ID: <Pine.LNX.4.10.9909211645170.23146-100000@bsmlx17> (raw)
In-Reply-To: <199909211523.LAA11575@candle.pha.pa.us>

On Tue, 21 Sep 1999, Bruce Momjian wrote:
> OK, I am jumping in here, because it seems we have some strange
> behavour.
> 
> The only subselect problem I know of is that:
> 
> 	select b from a where b in (select d from c) 
> 
> will execute the subquery just once, but will do a sequential scan for
> of the subquery results for each row of 'a' looking for 'b' that is in
> the set of result rows.

Oh, OK, that's very possible.  I was always under the impression (very
possibly missguided) that the reason it took a long time to do a "in
(select...)" was that the sub-select was actually executed for every row
in 'a' so that you ended up doing:

1x sequential scan of a
ax select on c

whereas if you did the sub-select ide[endently and cut-and-pasted the
obtained set into the "in (...)" you were in point of fact just doing:

1X sequential scan of a (each of them with loads of OR statements).

therefore saving "ax select" time.

Bruce, I appologise if I've completely missunderstood what's going on and
that your e-mail was all about correcting me.  I don't have a good grasp
of seq-scan vs. (nested-)joins vs. hash joins vs. mergejoins etc.
(although any pointers on where to get a crash course in these would be
greatly appreciated).  
 
> This is a major performance problem, one that is known, and one that
> should be fixed, but I am sounding like a broken record.

yeah, again appologise if this has been discussed to death in the past and
I missed it all (or it went over my head ;) )

> The solution is to allow the subquery results to be mergejoined(sorted),
> or hashjoined with the outer query.

erm...

> Am I correct, or is something else going on here?

most probably correct... :)

regards,

S.






view thread (8+ messages)  latest in thread

Message-ID: <Pine.LNX.4.10.9909211645170.23146-100000@bsmlx17>
Permalink:  ../Pine.LNX.4.10.9909211645170.23146-100000@bsmlx17/
Also on:    postgresql.org/message-id/Pine.LNX.4.10.9909211645170.23146-100000@bsmlx17

 · 

reply

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Reply to all the recipients from your mail client; the link fills in
  the headers below: reply via email
  Some clients, webmail especially, drop In-Reply-To and References from
  a link, and the reply then starts a new thread: use the mbox below.

  To: pgsql-sql@postgresql.org
  Cc: rison@biochemistry.ucl.ac.uk, maillist@candle.pha.pa.us, tgl@sss.pgh.pa.us, ridruejo@atm9.com.dtu.dk, pgsql-sql@hub.org
  Subject: Re: [SQL] Subselect performance
  In-Reply-To: <Pine.LNX.4.10.9909211645170.23146-100000@bsmlx17>
  References: <199909211523.LAA11575@candle.pha.pa.us> <Pine.LNX.4.10.9909211645170.23146-100000@bsmlx17>

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox