Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Saydakov, Alexander"'
The $k$-Minimum Values (\kmv) data sketch algorithm stores the $k$ least hash keys generated by hashing the items in a dataset. We show that compression based on ordering the keys and encoding successive differences can offer $O(\log n)$ bits per key
Externí odkaz:
http://arxiv.org/abs/2409.02852
