Re: fts, compond words?

Поиск
Список
Период
Сортировка
От Andrew J. Kopciuch
Тема Re: fts, compond words?
Дата
Msg-id 200512071021.05321.akopciuch@bddf.ca
обсуждение исходный текст
Ответ на Re: fts, compond words?  (Mike Rylander <mrylander@gmail.com>)
Ответы Re: fts, compond words?  (Oleg Bartunov <oleg@sai.msu.su>)
Список pgsql-general
> >   A & (B | (New OperatorTheNextWordMustFollow York))
>

I had thought about this before myself.  Alas I have never had the time to
properly investigate implementing such a feature.

:(

A & (B | (New + York))

Something like that?

> Actually, I love that idea.  Oleg, would it be possible to create a
> tsquery operator that understands proximity?  Or, how allowing a
> predicate to the current '&' op, as in '&[dist<=1]' meaning "next
> token follows with a max distance of  1".  I imagine that it would
> only be useful on unstripped tsvectors, but if the lexem position is
> already stored ...
>

Would the proximity go in both directions?  Or just forward? What about tokens
that come before?  Just a thought.



Andy

В списке pgsql-general по дате отправления:

Предыдущее
От: "A. Kretschmer"
Дата:
Сообщение: Re: Problem: libpq, network traffic, memory usage
Следующее
От: Volkan YAZICI
Дата:
Сообщение: Re: Problem: libpq, network traffic, memory usage