Re: [HACKERS] path toward faster partition pruning
От | Robert Haas |
---|---|
Тема | Re: [HACKERS] path toward faster partition pruning |
Дата | |
Msg-id | CA+Tgmoam1nRQQ7cVaccyaCCY2B-0WTjmSm_0An_GAdxV0WuXxQ@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: [HACKERS] path toward faster partition pruning (Amit Langote <Langote_Amit_f8@lab.ntt.co.jp>) |
Ответы |
Re: [HACKERS] path toward faster partition pruning
|
Список | pgsql-hackers |
On Fri, Oct 27, 2017 at 3:17 AM, Amit Langote <Langote_Amit_f8@lab.ntt.co.jp> wrote: >> I don't think we really want to get into theorem-proving here, because >> it's slow. > > Just to be clear, I'm saying we could use theorem-proving (if at all) just > for the default partition. I don't really see why it should be needed there either. We've got all the bounds in order, so we should know where there are any gaps that are covered by the default partition in the range we care about. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
В списке pgsql-hackers по дате отправления: