Re: Efficient Searching of Large Text Fields

O Oleg Bartunov έγραψε στις Jun 14, 2006 :

> Don't invent a wheel and use contrib/tsearch2 for that.

Hi Oleg,

i just wanted to ask if anything close to
exact phrase matching could be deployed/implemented with tsearch2.

>
> On Tue, 13 Jun 2006, Aaron Bono wrote:
>
> > In another post on a different topic, Rod Taylor said the following:
> >
> > "A\tcat in the\nhat" might be stored as ARRAY['A', 'cat', 'in', 'the',
> > 'hat'].
> >
> > This got me thinking. I have a discussion forum for gamers and want
> > to provide searching capabilities so the user can type in a phrase
> > like "magical bow" and get all posts, sorted by relevance that contain
> > these words.
> >
> > My questions are:
> > 1. Will storing the posts in an ARRAY help improve performance of
> > these searches? If so, by how much?
> > 2. What functions or libraries are available to make such searching
> > easy to implement well?
> > 3. What is the best way to sort by relevance?
> >
> > Thanks,
> > Aaron Bono
> >
> > ---------------------------(end of broadcast)---------------------------
> > TIP 3: Have you checked our extensive FAQ?
> >
> > http://www.postgresql.org/docs/faq
> >
>
> Regards,
> Oleg
> _____________________________________________________________
> Oleg Bartunov, Research Scientist, Head of AstroNet (www.astronet.ru),
> Sternberg Astronomical Institute, Moscow University, Russia
> Internet: oleg(at)sai(dot)msu(dot)su, http://www.sai.msu.su/~megera/
> phone: +007(495)939-16-83, +007(495)939-23-83
>
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Have you searched our list archives?
>
> http://archives.postgresql.org
>

--
-Achilleus