Re: Query plan prefers hash join when nested loop is much faster

From: Michael Lewis <mlewis(at)entrata(dot)com>
To: iulian dragos <iulian(dot)dragos(at)databricks(dot)com>
Cc: pgsql-general <pgsql-general(at)postgresql(dot)org>
Subject: Re: Query plan prefers hash join when nested loop is much faster
Date: 2020-08-21 16:30:24
Message-ID: CAHOFxGpb2_KB34MZdBGeH52nrkqPUkvf78j+V_b9Vt1by64Tfg@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Your system is preferring sequential scan to
using test_result_module_result_id_idx in this case. What type of storage
do you use, what type of cache hits do you expect, and what do you have
random_page_cost set to? That comes to mind as a significant factor in
choosing index scans based on costs.

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message greigwise 2020-08-21 16:56:21 pgbouncer bug?
Previous Message iulian dragos 2020-08-21 15:14:13 Query plan prefers hash join when nested loop is much faster