Skip site navigation (1) Skip section navigation (2)

Re: 7k records into Sort node, 4.5m out?

From: "Tomas Vondra" <tv(at)fuzzy(dot)cz>
To: "Christophe Pettus" <xof(at)thebuild(dot)com>
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Re: 7k records into Sort node, 4.5m out?
Date: 2012-08-14 01:35:21
Message-ID: dda48e8e4cd63cc6f98f9eca78016c05.squirrel@sq.gransy.com (view raw or flat)
Thread:
Lists: pgsql-performance
On 14 Srpen 2012, 3:15, Christophe Pettus wrote:
> Consider this EXPLAIN ANALYZE output:
>
> 	http://explain.depesz.com/s/TCi
>
> Note the Bitmap Heap Scan at the bottom claims to be producing 7094 rows,
> and the Sort above it expects to be processing 7330 rows (the same number
> the Bitmap Heap Scan expected to produce)... but the sort is actually
> producing 4512231 rows, which the sort time would indicate is what really
> happened.  How can this be?

Hi,

notice there's a merge join right above the sort. If there are duplicate
values in the first table (charlie in the explain plans), the matching
rows from the sort will be read repeatedly (re-scanned) and thus counted
multiple times.

Tomas



In response to

Responses

pgsql-performance by date

Next:From: Christophe PettusDate: 2012-08-14 01:48:48
Subject: Re: 7k records into Sort node, 4.5m out?
Previous:From: Christophe PettusDate: 2012-08-14 01:15:26
Subject: 7k records into Sort node, 4.5m out?

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group