Bloom filters are an essential class of probabilistic data structures designed for rapid set membership testing while minimising memory usage. By utilising multiple hash functions, these structures ...

"Smash: Flexible, Fast, and Resource-Efficient Placement and Lookup of Distributed Storage," by Yi Liu et al., introduces a storage system that is the first of its kind to apply minimal perfect ...

What i'm looking for then is a hashing function that works over a sequence of numbers that produces a reasonably well distributed hash while operating only within 31 bits (the max int size for VMs ...

This work presents an object placement and lookup method that achieves full placement flexibility, balanced load, low ...