Re: High Speed Text Searching Algorythms...

Jack Klein ...
>
> > 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....
>
>
> 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.

he he Jack that's a really "strict" answer.. :)) yes this is "comp.lang.c" be glad to share knowledge with other folks, and for Dave and his Q. mentioned algorithms simply relay on not-checking what needs no-checking..

Try looking the net for some sources they should be self-explanatory..

My opinion is that *most of search engines use something like those algorithms with focus is on well-organised data, if you search straight trough 13Gb of text it will be *slow no matter how good algorithm+hardware is...

Again, Web might have something for you

..Enjoy! Received on Thu Jul 20 2000 - 00:00:00 CEST