C Minimal Perfect Hashing Library 0.8 (Default branch) |
|
|
C Minimal Perfect Hashing Library is a portable
LGPL library to create and to work with minimal
perfect hashing functions. The library
encapsulates the newest and more efficient
algorithms available in the literature in an
easy-to-use, production-quality, fast API. The
library is designed to work with big entries that
cannot fit in the main memory. It has been used
successfully for constructing minimal perfect
hashing functions for sets with billions of keys.
License: GNU Lesser General Public License (LGPL)
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.
|
