| From: | Jeffrey Melloy <jmelloy(at)visualdistortion(dot)org> |
|---|---|
| To: | Mike Rylander <mrylander(at)gmail(dot)com> |
| Cc: | Teodor Sigaev <teodor(at)sigaev(dot)ru>, POSTGRESQL <pgsql-general(at)postgresql(dot)org> |
| Subject: | Re: fts, compond words? |
| Date: | 2005-12-07 22:37:30 |
| Message-ID: | 4397642A.50406@visualdistortion.org |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
Mike Rylander wrote:
>>
>>Mike Rylander wrote:
>>
>>
>>>On 12/6/05, Marcus Engene <mengpg(at)engene(dot)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 ...
>>>
>>>
This might not be a solution in the longer term, but what I do for that
type of thing is
idxfti @@ '(a&b)' and message ~* 'a b'
Postgres is smart enough to use the results of the GIST index and go
from there with the message scanning.
Jeff
| From | Date | Subject | |
|---|---|---|---|
| Next Message | A.j. Langereis | 2005-12-07 22:56:46 | Re: Letting a function return multiple columns instead of a single complex one |
| Previous Message | Claire McLister | 2005-12-07 21:50:44 | Re: Map of Postgresql Users (OT) |