Re: FTS on patterns
| От | Felipe de Jesús Molina Bravo |
|---|---|
| Тема | Re: FTS on patterns |
| Дата | |
| Msg-id | 1217946209.4369.4.camel@fjmb обсуждение исходный текст |
| Ответ на | FTS on patterns ("Vyacheslav Kalinin" <vka@mgcp.com>) |
| Список | 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? > > >
В списке pgsql-general по дате отправления: