Re: fts, compond words?
От | Mike Rylander |
---|---|
Тема | Re: fts, compond words? |
Дата | |
Msg-id | b918cf3d0512070854h439fdec8pce7c3dd9e587efcf@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: fts, compond words? (Marcus Engene <mengpg@engene.se>) |
Ответы |
Re: fts, compond words?
Re: fts, compond words? |
Список | pgsql-general |
On 12/6/05, Marcus Engene <mengpg@engene.se> wrote: [snip] > A & (B | (New OperatorTheNextWordMustFollow York)) > 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 ... -- Mike Rylander mrylander@gmail.com GPLS -- PINES Development Database Developer http://open-ils.org
В списке pgsql-general по дате отправления: