3 ms·
If you want to view it that way, it is data dependent hashing. That is the innovation: the mapping from data to hash is learned from the distribution of the dat
by noelwelsh 9y ago
If you want to view it that way, it is data dependent hashing. That is the innovation: the mapping from data to hash is learned from the distribution of the data.
- js8 9y agoIt's not really that new - gperf has been doing that for decades.
- eternalban 9y agoPerfect Hashing was crica 1984.
- noelwelsh 9y agoPerfect hashing provably has size that is O(n) in the data being indexed. You can think of this as approximate perfect hashing. You trade off a bit of accuracy for a lot of compression.
- eternalban 9y agoThanks. That [is] what I gathered as well. My OP was merely to note relevant existing results.