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

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Dane Foster <studdugie(at)gmail(dot)com>
Cc: psql-performance <pgsql-performance(at)postgresql(dot)org>
Subject: Re: Plan weirdness. A sort produces more rows than the node beneath it
Date: 2023-08-04 15:10:21
Message-ID: 3658472.1691161821@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

Dane Foster <studdugie(at)gmail(dot)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

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Dane Foster 2023-08-04 15:15:40 Re: Plan weirdness. A sort produces more rows than the node beneath it
Previous Message Dane Foster 2023-08-04 15:09:09 Re: Plan weirdness. A sort produces more rows than the node beneath it