Re: knngist - 0.8

Поиск
Список
Период
Сортировка
Искать
От
Alexander Korotkov
Тема
Re: knngist - 0.8
Дата
Msg-id
AANLkTinV_HK3CLC6_98coYkorPC75vsdYO7vheTmv5Yd@mail.gmail.com
Список
Дерево обсуждения
Re: knngist - 0.8 Alexander Korotkov <aekorotkov@gmail.com>
Re: knngist - 0.8 Robert Haas <robertmhaas@gmail.com>
Re: knngist - 0.8 Alexander Korotkov <aekorotkov@gmail.com>
Re: knngist - 0.8 Euler Taveira de Oliveira <euler@timbira.com>
Re: knngist - 0.8 David Fetter <david@fetter.org>
Re: knngist - 0.8 Alexander Korotkov <aekorotkov@gmail.com>
Re: knngist - 0.8 Robert Haas <robertmhaas@gmail.com>
I think that queries like this:
select * from test where val <-> 500 < 1 order by val <-> 500;
can also be optimized using knngist. In case of btree_gist this query can be easily rewritten:
select * from test where val > 499 and val < 501 order by val <-> 500;
But, in pg_trgm it makes it possible to combine different similarity levels in one query. For example:
select * from test_trgm order by t <-> 'asdf' < 0.5 or t <-> 'qwer' < 0.4;
Is there any chance to handle this syntax also?

----
With best regards,
Alexander Korotkov.
В списке pgsql-hackers по дате отправления
От: Pavel Stehule
Дата:
Сообщение: Re: review: xml_is_well_formed
От: Robert Haas
Дата:
FAQ