Re: fast wildcard searching on millions of strings

Thanks a lot! You pointed me into the right direction. Now I need to find a good implementation of it. I am investigatine OpenText's solution right now. I couldn't find any other good implementations. I looked at Sary and SAM and one other one, but it's docs are in japanese.

Don't have time to implement a good solution right now. Need one that will do wildcard searching and approximate matching for texts gigabytes in length. hrmmmm...anyone have any suggestions?

Thanks,
Ryan

Kai.Grossjohann_at_CS.Uni-Dortmund.DE (Kai Großjohann wrote in message news:<vafbslltb5t.fsf_at_lucy.cs.uni-dortmund.de>...
> rsit_at_ucsd.edu (rsit) writes:
>
> > Thanks for you post. It's just a large list of domain names and URLs
> > that I need to search on. You can think of it as a bunch of strings
> > with an average length of 18 characters. I am not searching or doing
> > anything with the documents at the URLs. I would like to put
> > wildcards(* or ?) anywhere on the query string.
>
> Hm. Searching with Google for "pat array" gets me to this page:
>
> http://www.dcc.uchile.cl/~gnavarro/abstracts/wsp96.1.html
>
> Maybe you can find the whole paper from there.
>
> > I tried to find information on OpenText, couldn't find it yet. Do you
> > have any links that could point me in the right direction?
>
> The obvious URL seems to be the right one. www.opentext.com.
> Hm. But I didn't say that OpenText is a company. Sorry.
>
> kai
Received on Wed Aug 15 2001 - 22:52:51 CEST