| From: | Gregory Stark <stark(at)enterprisedb(dot)com> |
|---|---|
| To: | "Peter Eisentraut" <peter_e(at)gmx(dot)net> |
| Cc: | <pgsql-hackers(at)postgresql(dot)org>, "Martijn van Oosterhout" <kleptog(at)svana(dot)org>, "Aidan Van Dyk" <aidan(at)highrise(dot)ca>, "Heikki Linnakangas" <heikki(at)enterprisedb(dot)com>, "Simon Riggs" <simon(at)2ndquadrant(dot)com>, "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Subject: | Re: Simplifying Text Search |
| Date: | 2007-11-13 13:12:23 |
| Message-ID: | 87sl3ajnm0.fsf@oxford.xeocode.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
"Peter Eisentraut" <peter_e(at)gmx(dot)net> writes:
> Am Dienstag, 13. November 2007 schrieb Gregory Stark:
>> "Peter Eisentraut" <peter_e(at)gmx(dot)net> writes:
>> > What we'd need is a way to convert a LIKE pattern into a tsquery
>> > ('%foo%bar%' => 'foo & bar'). Then you might even be able to sneak
>> > index-optimized text search into existing applications. Might be worth a
>> > try.
>>
>> I don't think that's the right direction to go. Notably "%foo%bar%" isn't
>> the same thing as "foo & bar". Also most tsearch queries can't be expressed
>> as LIKE patterns anyways.
>
> The requirement is to express LIKE patterns as tsearch queries, not the other
> way around.
As an optimization to use GIST indexes this is a cool idea. Much like our
existing functionality which converts "col LIKE 'bar%'" to range queries so it
can use btree indexes.
But it doesn't help the people who find "col @@ 'foo & bar'" confusing.
They're just being thrown off because "@@" is an unfamiliar operator.
--
Gregory Stark
EnterpriseDB http://www.enterprisedb.com
Ask me about EnterpriseDB's Slony Replication support!
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Gregory Stark | 2007-11-13 14:07:14 | Unnecessary casts in pg_cast |
| Previous Message | Peter Eisentraut | 2007-11-13 12:32:55 | Re: Simplifying Text Search |