gperf实用程序可以为中小型数据库快速生成完美散列。
The gperf utility is tuned to quickly generate a perfect hash for small to medium datasets.
完美散列函数是一种在时间和空间方面都十分高效的静态搜索集实现。
Perfect hash functions are time- and space-efficient implementations of static search sets.
事实上，可以在GUN编译器中使用它维护语言关键字的完美散列，其最新的功能使您能够操作更大的数据库。
In fact, it's the tool of choice of maintaining perfect hashes for language keywords in GNU compilers, and recent advances allow you to work with larger datasets.
产生的完美hash()函数返回一个无符号的int值，范围为 0..(k-1)，其中k 值为最大关键字散列值加 1。
The resulting perfect hash() function returns an unsigned int value in the range 0..(k-1), where k is the maximum keyword hash value +1.
LinkedIn在其Hadoop管道上构建了一个索引结构：这会产生几个TB的查找结构，该结构完美地使用了散列(每个键只需要2.5个位)。
LinkedIn builds an index structure in their Hadoop pipeline - this produces a multi-TB lookup structure that USES perfect hashing (requiring only 2.5 bits per key).
LinkedIn在其Hadoop管道上构建了一个索引结构：这会产生几个TB的查找结构，该结构完美地使用了散列(每个键只需要2.5个位)。
LinkedIn builds an index structure in their Hadoop pipeline - this produces a multi-TB lookup structure that USES perfect hashing (requiring only 2.5 bits per key).
应用推荐