Re: Self contradictory examining on rel's baserestrictinfo

Поиск
Список
Период
Сортировка
От Robert Haas
Тема Re: Self contradictory examining on rel's baserestrictinfo
Дата
Msg-id CA+TgmoY8z9gp0=xF7nw0AFTK=U46cXNLYFmu=4B27RBe3_KwQw@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Self contradictory examining on rel's baserestrictinfo  (ro b <bigbro_wq@hotmail.com>)
Список pgsql-hackers
On Wed, Nov 27, 2024 at 10:28 AM ro b <bigbro_wq@hotmail.com> wrote:
> I mean why can't draw the conclusions
> like the case a>1 and a>2 which can be simplified
> to a>2 if the operator > is btree opclass.

This question has already been discussed in some detail on this email
thread. First, we sometimes do detect it, as discussed by Peter.
Second, it is an unusual case and so not worth spending a lot of CPU
cycles to detect, as discussed by Tom.

We might still accept a patch to improve things in this area. For
example, if somebody could find a way to change the code so that we
are able to detect more cases without needing to spend more CPU
cycles, I think everyone would like that. However, that may be a
tricky goal to accomplish.

--
Robert Haas
EDB: http://www.enterprisedb.com



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