From: | Roberto Mello <rmello(at)cc(dot)usu(dot)edu> |
---|---|
To: | Bernd von den Brincken <bvdb(at)asa(dot)de> |
Cc: | pgsql-sql(at)postgresql(dot)org |
Subject: | Re: Thank you ! Re: Is there any Faster workaround ?? |
Date: | 2002-04-15 15:23:29 |
Message-ID: | 20020415152329.GA18325@cc.usu.edu |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
On Wed, Apr 10, 2002 at 12:24:26PM +0200, Bernd von den Brincken wrote:
> >> > everyone knows "IN" is pain fully slow currently in pgsql
> >> > is the any fster alternative to above query
>
> Yes this question was posted before - and if so, and if the answer is so
> simple - would it not make sense to implement this wisdom in the optimizer?
The IN construct is slow in Oracle and probably other RDBMSs too. I don't
know if the PostgreSQL implementation is any slower than others (I don't
think it is).
-Roberto
--
+----| http://fslc.usu.edu/ USU Free Software & GNU/Linux Club |------+
Roberto Mello - Computer Science, USU - http://www.brasileiro.net/
http://www.sdl.usu.edu/ - Space Dynamics Lab, Developer
The more things change, the more they stay the same.
From | Date | Subject | |
---|---|---|---|
Next Message | Josh Berkus | 2002-04-15 15:46:46 | Re: data order problem |
Previous Message | Tom Lane | 2002-04-15 14:49:32 | Re: How slow is DISTINCT? |