Re: INDEX and JOINs

Поиск
Список
Период
Сортировка
Искать
От
Martijn van Oosterhout
Тема
Re: INDEX and JOINs
Дата
Msg-id
20071026130221.GD24394@svana.org
Ответ на
Re: INDEX and JOINs (Reg Me Please)
Список
Дерево обсуждения
INDEX and JOINs Reg Me Please <regmeplease@gmail.com>
Re: INDEX and JOINs Martijn van Oosterhout <kleptog@svana.org>
Re: INDEX and JOINs Reg Me Please <regmeplease@gmail.com>
Re: INDEX and JOINs Martijn van Oosterhout <kleptog@svana.org>
Re: INDEX and JOINs Reg Me Please <regmeplease@gmail.com>
Re: INDEX and JOINs Tom Lane <tgl@sss.pgh.pa.us>
Re: INDEX and JOINs Reg Me Please <regmeplease@gmail.com>
Re: INDEX and JOINs Andreas Kretschmer <akretschmer@spamfence.net>
Re: INDEX and JOINs Reg Me Please <regmeplease@gmail.com>
Re: INDEX and JOINs Andreas Kretschmer <akretschmer@spamfence.net>
Re: INDEX and JOINs Martijn van Oosterhout <kleptog@svana.org>
On Fri, Oct 26, 2007 at 02:39:28PM +0200, Reg Me Please wrote:
> > >----------------------------------------------------- Hash Join 
> > > (cost=3.95..382140.91 rows=274709 width=91) (actual
> > > time=1.929..57713.305 rows=92 loops=1)
> > >    Hash Cond: (t_dati.camp_id = t_campi.camp_id)
> 
> prove=# \d t_dati

Ok, my suggestion would be to run it with "enable_seqscan=off" and if
that is indeed faster, then try reducing random_page_cost.

Have a nice day,
-- 
Martijn van Oosterhout      http://svana.org/kleptog/
> From each according to his ability. To each according to his ability to litigate.
В списке pgsql-general по дате отправления
От: Tom Lane
Дата:
От: Tom Lane
Дата:
Сообщение: Re: INDEX and JOINs
FAQ