Re: High Speed Text Searching Algorythms...
Date: 2000/07/20
Message-ID: <sJh2ORrCfwd7LmgAWnifEJcNPMhS_at_4ax.com>#1/1
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
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
> 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
--
Home: http://jackklein.home.att.net
Received on Thu Jul 20 2000 - 00:00:00 CEST