From: | Oleg Bartunov <oleg(at)sai(dot)msu(dot)su> |
---|---|
To: | "Joshua D(dot) Drake" <jd(at)commandprompt(dot)com> |
Cc: | Hervé Piedvache <herve(at)elma(dot)fr>, 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:27:05 |
Message-ID: | Pine.GSO.4.61.0411161923030.10356@ra.sai.msu.su |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
On Tue, 16 Nov 2004, Joshua D. Drake wrote:
>
>>> 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.
for single word queries @@ should have the same performance as ilike with
index disabled and better for complex queries.
>
> Sincerely,
>
> Joshua D. Drake
>
>
>
>> Regards,
>>
>
>
>
Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg(at)sai(dot)msu(dot)su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83
From | Date | Subject | |
---|---|---|---|
Next Message | J. Andrew Rogers | 2004-11-16 19:43:38 | Re: Insertion puzzles |
Previous Message | Hervé Piedvache | 2004-11-16 16:21:18 | Re: Tsearch2 really slower than ilike ? |