Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance

From: Rahman Duran <a(dot)rahman(dot)duran(at)gmail(dot)com>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: pgsql-general(at)lists(dot)postgresql(dot)org
Subject: Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance
Date: 2025-12-30 07:07:22
Message-ID: CA+jeBreFqkGc9f=_cBcMWkw_E5tTU_Rw4FQi6ehCDrTR17anUw@mail.gmail.com
Views: Whole Thread | Raw Message | Download mbox | Resend email
Thread:
Lists: pgsql-general

Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, 30 Ara 2025 Sal, 09:51 tarihinde şunu yazdı:
>The fundamental problem here is not wanting to make assumptions about
>which character strings a non-deterministic collation will consider
>equal to which other character strings. If you have concrete ideas
>about how to improve that, let's hear them.

Thanks for the explanations. I am just a user, not a DB developer :) So no
ideas I am afraid. I was just surprised that running the lower() function
on every column of every row is way faster than using nondeterministic
collation. I will test GIN index with trigram to see if it helps. If not I
will leave the code as is with lower() functions.

Regards,
Rahman Duran

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Daniel Gustafsson 2025-12-30 08:24:30 Re: PQprepare result
Previous Message Tom Lane 2025-12-30 06:51:40 Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance