gperf VS meow_hash

Can create a ton of theoretical examples, but even in practice we use such data structures. An example that first came to mind is gperf which generates static hash table data structure for predefined set of strings (So you cannot add or remove any elements).

gperf is a generator for perfect hash functions. Its documentation has a bibliography that might contain helpful links.

I think gperf is what you need. Alternatively cmph.

Adding to this, there are tools such as gperf which are specifically designed for this. Apparently gperf works well for smaller number of keys but not for really high n (> 100,000 ish) and mph apparently works better for larger n.

I'm late on the reply but I was using xxhash for something similar, but found that Meow hash was faster for me. Feel free to benchmark, since I'm sure it could vary depending on CPU architecture.

for everyone who doesn't think highly of Casey Muratori (or at least the way he conducts himself online), the author of Meow Hash, took the criticism quite graciously:

https://twitter.com/cmuratori/status/1417546500083568641

https://github.com/cmuratori/meow_hash/issues/80

Is a standardized hashing algorithm required? SHA256 takes several CPU cycle per byte, but there are several hashing algorithm utilizing AES-NI that gives them 15-16 bytes per cycles, which translates to tens of gigabytes per second on modern CPU. At least one of them has been ported to .NET Core, and from what I see properly calls AES primitives.

MeowHash is the fastest non-cryptographic hash available online, and if it were used in CPython, which performs a hash for every fundamental operation in the language, then Python would be much faster.

Meow hash claims 3-4x faster hashing over this, still passes smhasher, and is a few years old. https://mollyrocket.com/meowhash

Have you seen the meow hash implementation? Would that be suitable for this ?