CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions (opens in new tab)

arXiv:2305.16545v2 Announce Type: replace-cross Abstract: Lookup tables are a fundamental structure in many data processing and systems applications. Examples include tokenized text in NLP, quantized embedding collections in recommendation systems, integer sketches for streaming data, and hash-based string representations in genomics. With the increasing size of web-scale data, such applications often require compression techniques that support fast random $O(1)$ lookup of individual paramet...