Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Graf, Thomas Mueller"'
Autor:
Graf, Thomas Mueller, Lemire, Daniel
Publikováno v:
Journal of Experimental Algorithmics 27, 2022
Bloom and cuckoo filters provide fast approximate set membership while using little memory. Engineers use them to avoid expensive disk and network accesses. The recently introduced xor filters can be faster and smaller than Bloom and cuckoo filters.
Externí odkaz:
http://arxiv.org/abs/2201.01174
Autor:
Graf, Thomas Mueller, Lemire, Daniel
Publikováno v:
Journal of Experimental Algorithmics 25 (1), 2020
The Bloom filter provides fast approximate set membership while using little memory. Engineers often use these filters to avoid slow operations such as disk or network accesses. As an alternative, a cuckoo filter may need less space than a Bloom filt
Externí odkaz:
http://arxiv.org/abs/1912.08258
A minimal perfect hash function bijectively maps a key set $S$ out of a universe $U$ into the first $|S|$ natural numbers. Minimal perfect hash functions are used, for example, to map irregularly-shaped keys, such as string, in a compact space so tha
Externí odkaz:
http://arxiv.org/abs/1910.06416
Autor:
Graf, Thomas Mueller, Lemire, Daniel
Publikováno v:
Journal of Experimental Algorithmics (JEA); Jul2020, Vol. 25 Issue 1, p1-16, 18p
