Re:Ask HN: What are some cool but obscure data structures yo...
by samorozco on Friday July 22, 2022 @11:05AM
(#32192693)
It's not a data structure but a really cool algorithm. Locality Sensitive Hashing. It allows like items to be hashed to the same value. So instead of a typical hashing functions that wants to avoid collisions this algorithm tries to optimize for collisions.
https://en.wikipedia.org/wiki/Locality-sensitive_hashing