| From: | Felipe de Jesús Molina Bravo <felipe(dot)molina(at)inegi(dot)gob(dot)mx> |
|---|---|
| To: | Vyacheslav Kalinin <vka(at)mgcp(dot)com> |
| Cc: | PGSQL <pgsql-general(at)postgresql(dot)org> |
| Subject: | Re: FTS on patterns |
| Date: | 2008-08-05 14:23:28 |
| Message-ID: | 1217946209.4369.4.camel@fjmb |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
tsearch can help you; i have a system with it ... and its ok.
El mar, 05-08-2008 a las 18:03 +0400, Vyacheslav Kalinin escribió:
> Hello,
>
> In our application we need a pattern based text search, that is if
> user supplies 'foo bar' he receives only documents containing words
> that begin with 'foo' or 'bar', including themselves (something
> similar to MySQL '+foo* +bar*' text search query). Currently we use
> separate table for unique words in document and do LIKE 'foo%' search
> on that table, combining the results afterwards, and I am not really
> happy with that solution because of its speed and overcomplication of
> the queries involved. Does anyone know of a better approach? Could
> this be achieved with Postgres full text search?
>
>
>
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2008-08-05 14:53:53 | Re: FTS on patterns |
| Previous Message | Vyacheslav Kalinin | 2008-08-05 14:03:15 | FTS on patterns |