Finally, it might be interesting to play with masking different amount of bits to see the space-saving vs. lookup time tradeoffs for different degrees of sparseness.
By all means; play.
In reply to Re^3: Store larg hashes more efficiently (10e6 md5s in 260MB at 4µs per lookup)
by BrowserUk
in thread Store large hashes more efficiently
by puterboy
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |