Learned static functions combine per-key ML-predicted prefix codes with classic static function storage to compress static key-value mappings beyond zero-order entropy limits.
Modern minimal perfect hashing: A survey,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
New sampling-based constructions achieve better space upper bounds for α-perfect hashing than a baseline randomizing between perfect and zero-bit hashing, for all α in [0,1].
citing papers explorer
-
Learned Static Function Data Structures
Learned static functions combine per-key ML-predicted prefix codes with classic static function storage to compress static key-value mappings beyond zero-order entropy limits.
-
Space Upper Bounds for $\alpha$-Perfect Hashing
New sampling-based constructions achieve better space upper bounds for α-perfect hashing than a baseline randomizing between perfect and zero-bit hashing, for all α in [0,1].