Re: High Speed Text Searching Algorythms...

Jack Klein <jackklein_at_spamcop.net> posted:

> On Wed, 19 Jul 2000 22:59:35 -0700, Paradox <sbin_at_mindless.com> wrote
> in comp.lang.c:
>
> > As an interesting CS project, I'm looking into different text searching
> > algorythms, everything from simple strncmp to things like
> > Knuth-Morris-Pratt and Boyer-Moore algorythms. But I was wondering, I
> > know company's like Google (and proably other high speed internet search
> > engines) have their own implimentations of search engines. But it seems
> > as though for text searching, those are extreamly fast, proably
> > searching records in the billions in under 1 second. What kind of
> > algorythms do systems like that use? Are there any places online that I
> > can find descriptions of these algorythms?
> >
> > Any reccomendations would be greatly appreciated....
> >
> > Thanks
> > Dave
> > sbin_at_mindless.com
>
> This question is strictly about algorithms and has nothing at all to
> do with either the C or C++ programming languages. Watch your
> indiscriminate cross-posting in the future.
>
> Jack Klein
> --
> Home: http://jackklein.home.att.net

Go suck a lemon, Jack Small. Received on Thu Jul 20 2000 - 00:00:00 CEST