| From: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
|---|---|
| To: | Gregory Stark <stark(at)enterprisedb(dot)com> |
| 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 12:32:55 |
| Message-ID: | 200711131332.56853.peter_e@gmx.net |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
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.
--
Peter Eisentraut
http://developer.postgresql.org/~petere/
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Gregory Stark | 2007-11-13 13:12:23 | Re: Simplifying Text Search |
| Previous Message | Gregory Stark | 2007-11-13 12:13:26 | Re: Simplifying Text Search |