Version 0.8 of C Minimal Perfect Hashing Library
Release Notes: 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.
Other releases
Release Notes: This release introduces a new experimental C++11 interface (--enable-cxxmph) implementing the BDZ algorithm in a convenient SimpleMPHIndex interface, which serves as the basis for drop-in replacements for std::unordered_map, sparsehash::sparse_hash_map, and sparsehash::dense_hash_map. This gives faster lookup time at the expense of insertion time. cxxmpph/mph_map.h and cxxmph/mph_index.h contain details. As a bonus, most warnings in the C code were removed.
Release Notes: This release fixes a bug in the chd_pc algorithm and reorganizes tests.
Release Notes: This is a bugfix only version, after which a revamp of the cmph code and algorithms will be done.
Release Notes: This release introduces the CHD algorithm, currently the fastest linear algorithm in the literature for building perfect hash functions and minimal perfect hash functions. The generated functions are also the most compact known to date. Also, the CHD algorithm supports t-perfect hash functions, which can have at most t collisions in a given bin. This allow building hash tables for small key/value pairs that work efficiently with block-based storage, such as hard disks.
Release Notes: 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.
