5,336
edits
Line 18: | Line 18: | ||
;Interesting details | ;Interesting details | ||
* Hash collisions are ignored. | * Hash collisions are ignored. | ||
* The hash function used is: <math>h(\mathbf{x}) = \left( \ | * The hash function used is: <math>h(\mathbf{x}) = \left( \oplus_{i=1}^{d} x_i \pi_i \right) \mod T</math> | ||
** <math>\ | ** <math display="inline">\oplus</math> is bitwise XOR. | ||
** <math>\pi_i</math> are unique large primes. | ** <math display="inline">\pi_i</math> are unique large primes. | ||
** <math>T</math> is the size of the hash table. | ** <math display="inline">T</math> is the size of the hash table. | ||
==Experiments== | ==Experiments== | ||
==References== | ==References== | ||
[[Category: Papers]] | [[Category: Papers]] |