Re: Plan weirdness. A sort produces more rows than the node beneath it

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: Plan weirdness. A sort produces more rows than the node beneath it
Дата
Msg-id 3658472.1691161821@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Plan weirdness. A sort produces more rows than the node beneath it  (Dane Foster <studdugie@gmail.com>)
Ответы Re: Plan weirdness. A sort produces more rows than the node beneath it  (Dane Foster <studdugie@gmail.com>)
Список pgsql-performance
Dane Foster <studdugie@gmail.com> writes:
> I'm trying to understand a bit of weirdness in a plan output. There is a
> sort node above a sequential scan node where the scan node produces 26,026
> rows yet the sort node above it produces 42,995,408. How is it possible to
> sort more data than you received?

If the sort is the inner input to a merge join, this could reflect
mark-and-restore rescanning of the sort's output.  Are there a
whole lot of duplicate keys on the merge's other side?

            regards, tom lane



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

Предыдущее
От: Dane Foster
Дата:
Сообщение: Re: Plan weirdness. A sort produces more rows than the node beneath it
Следующее
От: Dane Foster
Дата:
Сообщение: Re: Plan weirdness. A sort produces more rows than the node beneath it