What are good hashing functions for hashing `n`-dimensional non-negative integer vectors whose sum less than or equal to order `m`?

Asked Apr 04 '18 at 03:09

Active Apr 04 '18 at 03:29

Viewed 79 times

What are good hashing functions for hashing n-dimensional non-negative integer vectors whose sum less than or equal to order m?

For example m,n=2 will need to hash (0,0),(1,0),(0,1),(2,0),(1,1),(0,2)

What if n>>m?

I saw this answer Hashing 2D, 3D and nD vectors but not sure if this works well for integers instead of float.

edited Apr 04 '18 at 03:29

asked Apr 04 '18 at 03:09

ZHU

Why would you think that it wouldn't work well with integers? – Jim Mischel Apr 04 '18 at 17:27
I think there may be better way to hash if we are only looking at a small subset of integers? – ZHU Apr 05 '18 at 05:26
How small is the subset of integers? What are the ranges? – Jim Mischel Apr 05 '18 at 15:41
Does it need to be hashing? If you simply need a datastructure to store n-dimensional vectors, have a look at quadtrees, kd-trees, R-Trees, ... – TilmannZ Apr 05 '18 at 17:27

0 Answers0