Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance - Mailing list pgsql-general

From Rahman Duran
Subject Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance
Date
Msg-id CA+jeBreFqkGc9f=_cBcMWkw_E5tTU_Rw4FQi6ehCDrTR17anUw@mail.gmail.com
Whole thread Raw
In response to Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance  (Tom Lane <tgl@sss.pgh.pa.us>)
List pgsql-general
Tom Lane <tgl@sss.pgh.pa.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

pgsql-general by date:

Previous
From: Tom Lane
Date:
Subject: Re: PostgreSQL 18.1 non deterministic collation "LIKE %abc%" performance
Next
From: Daniel Gustafsson
Date:
Subject: Re: PQprepare result