On Saturday 26 January 2002 03:40 pm, Sam Tregar wrote: > Think search engines. Once you've figured out how to get your search > database to fit in memory (or devised a cachin strategy to get the > important parts there) you're essentially looking at a CPU-bound problem. > These days the best solution is probably some judicious use of Inline::C. > Back when I last tackled the problem I had to hike up mount XS to find my > grail...
I agree. There are some situations that are just too complex for a DBMS to handle directly, at least in any sort of efficient fashion. However, depending on the load in those cases, Perrin's solution for eToys is probably a good approach (i.e. custom search software written in C/C++). -- Milo Hyson CyberLife Labs, LLC
