Re: [HACKERS] psql nested queries with 2000+ records
От | Bruce Momjian |
---|---|
Тема | Re: [HACKERS] psql nested queries with 2000+ records |
Дата | |
Msg-id | 199803201724.MAA08299@candle.pha.pa.us обсуждение исходный текст |
Ответ на | psql nested queries with 2000+ records (Coronach <coronach@hill-b-073.resnet.purdue.edu>) |
Ответы |
Re: [HACKERS] psql nested queries with 2000+ records
|
Список | 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%'); Very strange. 15+ minutes? Wow, that is terrible, even longer than a sequential scan of the table. Try EXPLAIN and tell us what it says in the two cases. > > 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 Same OS here. -- Bruce Momjian | 830 Blythe Avenue maillist@candle.pha.pa.us | Drexel Hill, Pennsylvania 19026 + If your life is a hard drive, | (610) 353-9879(w) + Christ can be your backup. | (610) 853-3000(h)
В списке pgsql-hackers по дате отправления: