> We have CPU that can be used for compression, that's for sure (I'm thinking
> of the fact that my process manipulating the db spend 80% of the time waiting
> for IO, in the worst case). However, having to uncompress a key each time
> the comparison function is called freaks me out. This morning I've build
> my own comparison function (to handle the key format invented by Geoff
> in htdig). I did not care about efficiency and it used 25% of the CPU time of
> the process. What will it be if uncompression is involved ?
I have no idea, I'm not sure how fast Huffman engines can
run. We'll just have to find out...
--keith
------------------------------------
To unsubscribe from the htdig3-dev mailing list, send a message to
[EMAIL PROTECTED] containing the single word "unsubscribe" in
the SUBJECT of the message.
