Re: Tsearch2 really slower than ilike ?

From: "Joshua D(dot) Drake" <jd(at)commandprompt(dot)com>
To: Hervé Piedvache <herve(at)elma(dot)fr>
Cc: Michael Fuhr <mike(at)fuhr(dot)org>, pgsql-performance(at)postgresql(dot)org
Subject: Re: Tsearch2 really slower than ilike ?
Date: 2004-11-16 16:04:28
Message-ID: 419A250C.9020300@commandprompt.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance


>>or more.
>>
>>
>
>Yes site name ... is company names or web site name ... so not many word in
>each record ... but I don't understand why more words are more efficient than
>few words ?? sorry ...
>
>
Well there are a couple of reasons but the easiest one is index size.
An ILIKE btree index is in general going to be much smaller than a gist
index.
The smaller the index the faster it is searched.

Sincerely,

Joshua D. Drake

>Regards,
>
>

--
Command Prompt, Inc., home of Mammoth PostgreSQL - S/ODBC and S/JDBC
Postgresql support, programming shared hosting and dedicated hosting.
+1-503-667-4564 - jd(at)commandprompt(dot)com - http://www.commandprompt.com
PostgreSQL Replicator -- production quality replication for PostgreSQL

Attachment Content-Type Size
jd.vcf text/x-vcard 285 bytes

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Joshua D. Drake 2004-11-16 16:06:25 Re: Tsearch2 really slower than ilike ?
Previous Message James Gunzelman 2004-11-16 15:57:07 Efficient way to remove OID data