| From: | Simon Riggs <simon(at)2ndquadrant(dot)com> |
|---|---|
| To: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Simplifying Text Search |
| Date: | 2007-11-14 02:18:07 |
| Message-ID: | 1195006687.4378.42.camel@ebony.site |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Tue, 2007-11-13 at 13:32 +0100, Peter Eisentraut wrote:
> 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.
+1
--
Simon Riggs
2ndQuadrant http://www.2ndQuadrant.com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Trevor Talbot | 2007-11-14 02:42:46 | Re: Simplifying Text Search |
| Previous Message | Heikki Linnakangas | 2007-11-13 22:14:16 | Re: How to keep a table in memory? |