Re: Query much slower when run from postgres function

Поиск
Список
Период
Сортировка
От fche@redhat.com (Frank Ch. Eigler)
Тема Re: Query much slower when run from postgres function
Дата
Msg-id y0mr615785o.fsf@ton.toronto.redhat.com
обсуждение исходный текст
Ответ на Re: Query much slower when run from postgres function  (Tom Lane <tgl@sss.pgh.pa.us>)
Ответы Re: Query much slower when run from postgres function  (Tom Lane <tgl@sss.pgh.pa.us>)
Список pgsql-performance
Tom Lane <tgl@sss.pgh.pa.us> writes:

> Mario Splivalo <mario.splivalo@megafon.hr> writes:
>> Now I'm confused, why is 'sql' function much slower than 'direct' SELECT?
>
> Usually the reason for this is that the planner chooses a different plan
> when it has knowledge of the particular value you are searching for than
> when it does not.  I suppose 'service_id' has a very skewed distribution
> and you are looking for an uncommon value?

For a prepared statement, could the planner produce *several* plans,
if it guesses great sensitivity to the parameter values?  Then it
could choose amongst them at run time.

- FChE

В списке pgsql-performance по дате отправления:

Предыдущее
От: Matthew Wakeling
Дата:
Сообщение: Re: When does sequential performance matter in PG?
Следующее
От: henk de wit
Дата:
Сообщение: Re: When does sequential performance matter in PG?