| From: | "Andrew J(dot) Kopciuch" <akopciuch(at)bddf(dot)ca> |
|---|---|
| To: | pgsql-general(at)postgresql(dot)org |
| Cc: | Mike Rylander <mrylander(at)gmail(dot)com>, Oleg Bartunov <oleg(at)sai(dot)msu(dot)su> |
| Subject: | Re: fts, compond words? |
| Date: | 2005-12-07 17:21:04 |
| Message-ID: | 200512071021.05321.akopciuch@bddf.ca |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | 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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Volkan YAZICI | 2005-12-07 17:27:04 | Re: Problem: libpq, network traffic, memory usage |
| Previous Message | Bruce Momjian | 2005-12-07 17:20:14 | Re: [GENERAL] Map of Postgresql Users (OT) |