Re: Optimization for lower(), upper(), casefold() functions.

Поиск
Список
Период
Сортировка
Искать
От
Jeff Davis
Тема
Re: Optimization for lower(), upper(), casefold() functions.
Дата
Msg-id
3ffb8b75b26e76624668c0883cac7886468c5d07.camel@j-davis.com
Список
Дерево обсуждения
Re: Optimization for lower(), upper(), casefold() functions. Jeff Davis <pgsql@j-davis.com>
Re: Optimization for lower(), upper(), casefold() functions. Alexander Borisov <lex.borisov@gmail.com>
On Tue, 2025-02-04 at 23:19 +0300, Alexander Borisov wrote:
> I've done many different experiments and everywhere the result is
> within
> the margin of the v2 patch result.

Great, thank you for working on this!

There doesn't appear to be a downside. Even though it's more complex,
we have exhaustive tests to compare with ICU, so that should catch any
correctness issues.

Heikki mentioned the radix tree, so I'd be interested to know what the
trade-offs there are. I don't have a strong opinion, but I'd like to be
able to explain why we use a radix tree for encoding conversions and
the generated branches approach in this patch for case mapping.

Also, I have a question: when there are deeply-nested "if" statements,
like in this patch, can that create a burden on the branch predictor
that affects code elsewhere?

Regards,
	Jeff Davis



В списке pgsql-hackers по дате отправления
От: Jelte Fennema-Nio
Дата:
От: Nathan Bossart
Дата:
FAQ