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

Поиск
Список
Период
Сортировка
От Michael Lewis
Тема Re: Query plan prefers hash join when nested loop is much faster
Дата
Msg-id CAHOFxGpb2_KB34MZdBGeH52nrkqPUkvf78j+V_b9Vt1by64Tfg@mail.gmail.com
обсуждение исходный текст
Ответ на Query plan prefers hash join when nested loop is much faster  (iulian dragos <iulian.dragos@databricks.com>)
Ответы Re: Query plan prefers hash join when nested loop is much faster  (iulian dragos <iulian.dragos@databricks.com>)
Список 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.

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

Предыдущее
От: iulian dragos
Дата:
Сообщение: Query plan prefers hash join when nested loop is much faster
Следующее
От: greigwise
Дата:
Сообщение: pgbouncer bug?