Re: Performance of a nested loop, whose inner loop uses an index scan.

From: Matheus de Oliveira <matioli(dot)matheus(at)gmail(dot)com>
To: negora <public(at)negora(dot)com>
Cc: pgsql-performance <pgsql-performance(at)postgresql(dot)org>
Subject: Re: Performance of a nested loop, whose inner loop uses an index scan.
Date: 2016-10-19 11:15:59
Message-ID: CAJghg4Lbs-a-_xTmdTWcuQTiZCpv8hTjv2-kWc2_teyNAWiD8w@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

On Wed, Oct 19, 2016 at 8:54 AM, negora <public(at)negora(dot)com> wrote:

> Nested Loop (cost=245.92..383723.28 rows=7109606 width=38) (actual
> time=1.091..2616.553 rows=8906075 loops=1)
>

I wonder about the use-case for this query, because it returns more than 8M
rows, so 2.6 seconds that sounds that much for so many rows. Is it for an
end user application? Isn't there any kind of pagination?

--
Matheus de Oliveira

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message negora 2016-10-19 17:07:13 Re: Performance of a nested loop, whose inner loop uses an index scan.
Previous Message negora 2016-10-19 10:54:46 Performance of a nested loop, whose inner loop uses an index scan.