From: | Vinko Vrsalovic <el(at)vinko(dot)cl> |
---|---|
To: | Qingqing Zhou <zhouqq(at)cs(dot)toronto(dot)edu> |
Cc: | pgsql-performance(at)postgresql(dot)org |
Subject: | Re: slow "IN" clause |
Date: | 2006-04-11 05:02:28 |
Message-ID: | 1144731748.9011.2.camel@localhost.localdomain |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
On lun, 2006-04-10 at 12:44 +0800, Qingqing Zhou wrote:
> <FavoYang(at)gmail(dot)com> wrote
> > I have a slow sql:
> > SELECT * FROM mytable WHERE id IN (1,3,5,7,....3k here...);
> > mytable is about 10k rows.
> >
> > if don't use the "IN" clause, it will cost 0,11 second, otherwise it
> > will cost 2.x second
> > I guess pg use linear search to deal with IN clause, is there any way
> > to let pg use other search method with IN clause? (ex.Binary Search or
> > hash Search)
> >
>
> If you can put (1, 3, .., 3k) in a table, PG may choose a hash join.
And maybe using
SELECT * FROM yourtable WHERE id < 6002 AND id % 2 = 1;
turns out to be faster, if we are allowed to extrapolate from the
example.
V.
From | Date | Subject | |
---|---|---|---|
Next Message | soni de | 2006-04-11 07:05:27 | Re: Takes too long to fetch the data from database |
Previous Message | Tom Lane | 2006-04-11 01:01:37 | Re: Encouraging multi-table join order |