Calculating the right number of bits in a bloom filter...

Filter for range queries on a set...

Fast way to find the row associated with a given Guid across many SQL databases and tables...

Need memory efficient way to store tons of strings (was: HAT-Trie implementation in java)...

If I have an array of keys M, and an array of targets N, how can I verify that M[i] exists in N befo...

Using hash functions with Bloom filters...

Needed an efficient way for search for the following specfic requirement...

compact data structure like set...