It seems that this is a special case of hashing, indicated by the word 'perfect'...

		lucb1e on Jan 11, 2019 \| parent \| context \| favorite \| on: Use perfect hashing, instead of binary search, for... It seems that this is a special case of hashing, indicated by the word 'perfect', where it somehow (I did not read the article and I don't know how this is done) generates a guaranteed collision-free hash table. While you can do the same with cryptographic hash functions, I'm sure that those are much slower than what is implemented as non-cryptographically secure hash function in databases.

@jnwatson included “perfect” in his comment. And he is correct, it is surprising that this wasn’t already the case.