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?
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?
