psql nested queries with 2000+ records

From: Coronach <coronach(at)hill-b-073(dot)resnet(dot)purdue(dot)edu>
To: pgsql-hackers(at)postgresql(dot)org
Subject: psql nested queries with 2000+ records
Date: 1998-03-20 16:31:17
Message-ID: 3.0.5.32.19980320113117.00794c30@diety.conclave.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

I have noted with 2000+ records in a table (using a btree unique index on
the primary key, btw) performance of a query takes 15+ minutes to respond.

The query is in the structure of this

select foo from bar where foo in (select foo from bar where bazzfoo like
'Word%');

Just reporting a possible bug..

With smaller amounts of records, responce time is within a few seconds.

Other information you might want:

postgres version: 6.3
os: BSDI 3.1

Thanks
-coronach(at)hill-b-073(dot)resnet(dot)purdue(dot)edu

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Ivar Helbekkmo 1998-03-20 16:40:01 Re: [HACKERS] tables >2GB
Previous Message Kapoor, Nishikant X 1998-03-20 15:06:09 newbie question