From: | Michael Lewis <mlewis(at)entrata(dot)com> |
---|---|
To: | Jeremy Finzel <finzelj(at)gmail(dot)com> |
Cc: | PostgreSQL mailing lists <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: BRIN index which is much faster never chosen by planner |
Date: | 2019-10-10 22:19:36 |
Message-ID: | CAHOFxGo_NJcuiKTABR3UHtd0sdnXizEsYXgMZ0So93kdpkdVhQ@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Since the optimizer is choosing a seq scan over index scan when it seems
like it has good row estimates in both cases, to me that may mean costs of
scanning index are expected to be high. Is this workload on SSD? Has the
random_page_cost config been decreased from default 4 (compared with cost
of 1 unit for sequential scan)?
Your buffer hits aren't great. What is shared_buffers set to? How much ram
on this cluster?
With this table being insert only, one assumes correlation is very high on
the data in this column as shown in pg_stats, but have your confirmed?
To me, distinct ON is often a bad code smell and probably can be re-written
to be much more efficient with GROUP BY, lateral & order by, or some other
tool. Same with the window function. It is a powerful tool, but sometimes
not the right one.
Is "source" a function that is called on field1? What is it doing/how is it
defined?
From | Date | Subject | |
---|---|---|---|
Next Message | Tomas Vondra | 2019-10-10 23:13:09 | Re: BRIN index which is much faster never chosen by planner |
Previous Message | Andrew Dunstan | 2019-10-10 22:01:14 | Re: stress test for parallel workers |