IN Qeury Problem

From: "Sameer Maggon" <maggon(at)newgen(dot)co(dot)in>
To: <pgsql-sql(at)postgresql(dot)org>
Subject: IN Qeury Problem
Date: 2003-04-17 19:27:54
Message-ID: PIEELGOGLBEAPIHJAMIDEEMHCHAA.maggon@newgen.co.in
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

Hello,

I am facing a problem regarding the performance of postgres. I am
concerned about the speed of the execution of a query when large number of
entries is given in the IN clause.

I have a Table with columns:

FolderName (Indexed)
FolderIndex (Indexed)
ParentFolderIndex (Indexed)
...
..

I have a query where i do a SELECT

SELECT * FROM FolderTable WHERE PARENTFOLDERINDEX IN (38::int8, ......);

If the number of values in IN clause is small, its working fine, but as and
when the number of values increases the speed of the query is detoriating
with a steep curve.

How can this problem be solved ?

Thanks and Regards
Sameer Maggon

Responses

Browse pgsql-sql by date

  From Date Subject
Next Message Tom Lane 2003-04-17 19:35:41 Re: Ordinal value of row within set returned by a query?
Previous Message David Goodwin 2003-04-17 19:08:14 Re: reversion? Recursion question