Andrew Snow wrote:
>
> Could you perhaps post the code you have for splitting a text field up into
> keys, then I could work on turning into a new type of index with a new
> operator, as Tom suggested?
>
> (Or is this already what the text search code in contrib already does??)
I think that spl
e <[EMAIL PROTECTED]>,
> > Hackers List <[EMAIL PROTECTED]>
> > Subject: RE: [HACKERS] OK, does anyone have any better ideas?
> >
> >
> > One possible idea for SQL integration: can one use index access-method
> > functions to query the FTS outside the da
"Edmar Wiggers" <[EMAIL PROTECTED]> writes:
> One possible idea for SQL integration: can one use index access-method
> functions to query the FTS outside the database?
Hm. In principle an index access method can do whatever it darn
pleases. In practice, though, I think the main problem with mak
TECTED]>
> Subject: RE: [HACKERS] OK, does anyone have any better ideas?
>
>
> One possible idea for SQL integration: can one use index access-method
> functions to query the FTS outside the database? Yes, it would require some
> work, but the results I guess it would be wonder
Personally, I'm not too afraid of having an FTS engine outside the database.
Oracle's Intermedia, which has a very powerful/fast FTS engine, uses that
approach.
I could look into how they do the SQL integration, maybe it would yeld some
ideas.
Mark, about that row identifier: OID's are no good f
Oleg Bartunov wrote:
> postgres... It would be great.
>
> Gotcha. It's impossible to return a set from a function, so the only
> way to use perl to parse your bitmap. We did (in one project) external
> search using suffix arrays which incredibly fast and use postgres to
> return results to pe
On Sat, 9 Dec 2000, mlw wrote:
> Date: Sat, 09 Dec 2000 08:18:10 -0500
> From: mlw <[EMAIL PROTECTED]>
> To: Oleg Bartunov <[EMAIL PROTECTED]>
> Cc: Tom Lane <[EMAIL PROTECTED]>,
> Hackers List <[EMAIL PROTECTED]>
> Subject: Re: [HACKERS] OK, do
Oleg Bartunov wrote:
>
> We need multi-key B-tree like index for such problem.
> Our full text search engine is based on arrays and we need to find quickly
> is some number exists in array - some kind of index over int array.
> We're currently testing GiST approach and seems will have some conclu
g
On Fri, 8 Dec 2000, mlw wrote:
> Date: Fri, 08 Dec 2000 20:17:34 -0500
> From: mlw <[EMAIL PROTECTED]>
> To: Tom Lane <[EMAIL PROTECTED]>
> Cc: Hackers List <[EMAIL PROTECTED]>
> Subject: Re: [HACKERS] OK, does anyone have any better ideas?
>
> Tom Lane wrote:
Andrew Snow wrote:
>
> Could you perhaps post the code you have for splitting a text field up into
> keys, then I could work on turning into a new type of index with a new
> operator, as Tom suggested?
>
> (Or is this already what the text search code in contrib already does??)
>
> - Andrew
OK
Andrew Snow wrote:
>
> Could you perhaps post the code you have for splitting a text field up into
> keys, then I could work on turning into a new type of index with a new
> operator, as Tom suggested?
>
> (Or is this already what the text search code in contrib already does??)
Go to a search e
Could you perhaps post the code you have for splitting a text field up into
keys, then I could work on turning into a new type of index with a new
operator, as Tom suggested?
(Or is this already what the text search code in contrib already does??)
- Andrew
mlw <[EMAIL PROTECTED]> writes:
> Then you call search with a string, such as "the long and winding road"
> or "software OR hardware AND engineer NOT sales." A few milliseconds
> later, a list of key/rank pairs are produced. This is FAR faster than
> the '~~~' operator because it never does a full
Tom Lane wrote:
>
> mlw <[EMAIL PROTECTED]> writes:
> > I have a working version of a text search engine. I want to make it work
> > for Postgres (I will be releasing it GPL). It can literally find the
> > occurrence of a string of words within 5 million records in a few
> > milliseconds.
>
> Wh
Tom Lane wrote:
>
> mlw <[EMAIL PROTECTED]> writes:
> > I have a working version of a text search engine. I want to make it work
> > for Postgres (I will be releasing it GPL). It can literally find the
> > occurrence of a string of words within 5 million records in a few
> > milliseconds.
>
> Wh
mlw <[EMAIL PROTECTED]> writes:
> I have a working version of a text search engine. I want to make it work
> for Postgres (I will be releasing it GPL). It can literally find the
> occurrence of a string of words within 5 million records in a few
> milliseconds.
Where are the records coming from?
I have a working version of a text search engine. I want to make it work
for Postgres (I will be releasing it GPL). It can literally find the
occurrence of a string of words within 5 million records in a few
milliseconds. It is very fast, it works similarly to many web search
engines.
I have trie
17 matches
Mail list logo
