From: | Tony(dot)Curtis(at)vcpc(dot)univie(dot)ac(dot)at |
---|---|
To: | "Gene Selkov Jr(dot)" <selkovjr(at)mcs(dot)anl(dot)gov> |
Cc: | pgsql-sql(at)postgreSQL(dot)org |
Subject: | Re: [SQL] [SQL, regex, words] how to match word boundaries using regex's? |
Date: | 1998-10-19 14:58:58 |
Message-ID: | 199810191459.QAA05951@haze.vcpc.univie.ac.at |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
Re: [SQL] [SQL, regex, words] how to match word boundaries
using regex's? , Gene <selkovjr(at)mcs(dot)anl(dot)gov> said:
Gene> I guess there are no backslash macros is POSIX
Gene> expressions. No joy. By the way, I am wondering what
No joy, Ren :-(
Gene> determined the choice of the regexp machine for
Gene> postgres? Is it performance-related? Is it possible to
Gene> have the same stuff as in perl?
That would be really nice. I was just considering how easy
it would be to pull out the current regex backend directory
and put perl-type (or GNU) ones there instead. Or is that
not the way to do it?
Could I write a new backend with overloaded/new operators to
do this?
Gene> Split the text into words before loading into a
Gene> special index table. Words are numbered sequentially,
Gene> so you can search for "phrases":
I had thought about doing this because the description
string will probably require interpretation at some level.
But I was looking for a straight-forward
inefficiency-be-damned-it's-only-a-demo-for-now solution.
tony
From | Date | Subject | |
---|---|---|---|
Next Message | David Mansfield | 1998-10-19 18:01:10 | index not used in like clause... |
Previous Message | Gene Selkov Jr. | 1998-10-19 13:33:23 | Re: [SQL] [SQL, regex, words] how to match word boundaries using regex's? |