in reply to Re^8: Byte allign compression in Perl..
in thread Byte allign compression in Perl..
Sound good enough for government work (in fact you beat Google) and certainly a practical working solution to the problem as stated. It does sound as though the OP has a bigger data set in mind though.
One point he does not seem to get is how the need to do this is reduced by caching as each time you had a search for "Some term" you would cache the first n results so you don't have to repeat the expensive task again. You can see Google do this if you search for 'aachen zwitterions'. The first search took 0.35 seconds to retrieve 514 results but the second search took only 0.07 seconds. I tried this on google.com.au and google.com so you will need to try another obscure pair or a different server farm to see it. What amazes me is the raw speed but then again there are probably several thousand machines dealing with the query.
Intruiging dataset you have there! I won't ask.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^10: Byte allign compression in Perl..
by BrowserUk (Patriarch) on Apr 13, 2008 at 10:34 UTC |