Re: Behavior of a pg_trgm index for 2 (or < 3) character LIKE queries
От | Amit Langote |
---|---|
Тема | Re: Behavior of a pg_trgm index for 2 (or < 3) character LIKE queries |
Дата | |
Msg-id | CA+HiwqFv0efdd_PA4cmS3E7_f18mdB0vPKkB=joF_y4qN+dy3Q@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Behavior of a pg_trgm index for 2 (or < 3) character LIKE queries (Robert Haas <robertmhaas@gmail.com>) |
Ответы |
Re: Behavior of a pg_trgm index for 2 (or < 3) character
LIKE queries
Re: Behavior of a pg_trgm index for 2 (or < 3) character LIKE queries |
Список | pgsql-hackers |
On Thu, May 30, 2013 at 11:47 PM, Robert Haas <robertmhaas@gmail.com> wrote: > On Wed, May 29, 2013 at 10:51 PM, Amit Langote <amitlangote09@gmail.com> wrote: >> So, it appears, for search strings consisting of 2 (or < 3) >> characters, trigrams can not be utilized. No? > > I think that's right. "trigram" means a sequence of three characters, > and what's stored in the indexes are three-character sequences from > the original text. > Was there any improvement to pg_trgm in recent past that could make it better for partial matching (the case in question I suppose) or is partial-matching a different thing altogether? -- Amit Langote
В списке pgsql-hackers по дате отправления: