Skip site navigation (1) Skip section navigation (2)

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 (view raw or flat)
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

pgsql-hackers by date

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

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group