Bloom Filters: an example Java implementation Having introduced the concept of a Bloom filter , we now look at an example Java implementation. We will consider the case of representing a set of strings. Generating hash codes The basic component that we need to implement our Bloom filter is a way of generating an arbitrary number of good-quality hash codes for a given string. Previously, we discussed a strong hash code implementation which produced 64-bit hash codes based on a table of random 64-bit numbers.
Read full article from Bloom filters in Java: example implementation
No comments:
Post a Comment