Re: Design notes for EquivalenceClasses

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: Design notes for EquivalenceClasses
Дата
Msg-id 15246.1169081164@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: Design notes for EquivalenceClasses  (Gavin Sherry <swm@linuxworld.com.au>)
Ответы Re: Design notes for EquivalenceClasses  (Gavin Sherry <swm@linuxworld.com.au>)
Список pgsql-hackers
Gavin Sherry <swm@linuxworld.com.au> writes:
> I was thinking about this, but in relation to hash joins. A hash join
> cannot be guaranteed to produce output sorted according to the pathkey of
> the outer relation (as explained in the existing README). I wonder,
> however, if it might be useful for hash join to pass a hint that the
> output is known ordered (i.e., the join was not split into multiple
> batches).

Yeah, I've considered that, but I think it'd have to be the other way
around: the planner tells the executor that it's assuming the output is
sorted, hence do not split into multiple batches.  This has the usual
assortment of problems if the planner has badly misestimated the
rowcount :-(
        regards, tom lane


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

Предыдущее
От: Jeff Davis
Дата:
Сообщение: Re: Function execution costs 'n all that
Следующее
От: Tom Lane
Дата:
Сообщение: Re: Function execution costs 'n all that