All releases tagged Major feature enhancements
- 06 May 2008 02:18
Changes: This version adds the internal memory bdz algorithm and utility functions to (de)serialize minimal perfect hash functions from mmap'ed memory regions. The new bdz algorithm for minimal perfect hashes requires 2.6 bits per key and is the fastest one currently available in the literature.
- 24 Feb 2007 05:32
Changes: This release adds an implementation of a classical minimal perfect hash algorithm called fch. This is used as a basis for a new algorithm that can create minimal perfect hashes for billions of keys with less than four bits per key, and is ready to use. Suggestions and bugfixes from users have been incorporated.
- 28 Apr 2006 17:03
Changes: Minor bugfixes, and the addition of a new algorithm for sets in the order of billions of keys that require approximately 8.1 bits per key to store the result.
