High Speed Text Searching Algorythms...

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 Received on Wed Jul 19 2000 - 00:00:00 CEST