[HN Gopher] Cuckoo Filter: Practically Better Than Bloom (2014) ...
       ___________________________________________________________________
        
       Cuckoo Filter: Practically Better Than Bloom (2014) [pdf]
        
       Author : Tomte
       Score  : 69 points
       Date   : 2022-10-24 16:26 UTC (6 hours ago)
        
 (HTM) web link (www.eecs.harvard.edu)
 (TXT) w3m dump (www.eecs.harvard.edu)
        
       | majke wrote:
       | A mandatory comment that reducing random memory fetches is often
       | way more important to perf than O() cost. Random memory read
       | costs a lot.
       | 
       | https://blog.cloudflare.com/when-bloom-filters-dont-bloom/
        
         | pickledish wrote:
         | This was an excellent post, learned a lot, thanks for linking
         | it!
        
       | awmarthur wrote:
       | related and useful: "Ribbon filter: Practically smaller than
       | Bloom and Xor" (https://arxiv.org/abs/2103.02515)
       | 
       | This paper does a good job of showing the space/time tradeoffs of
       | various approximate sets.
        
         | Genbox wrote:
         | Similarly, there is Binary Fuse Filters
         | (https://arxiv.org/abs/2201.01174) [1]
         | 
         | The paper includes comparisons with Ribbon filter
         | 
         | [1] Graf, T. M., & Lemire, D. (2022). Binary Fuse Filters: Fast
         | and Smaller Than Xor Filters. arXiv.
         | https://doi.org/10.1145/3510449
        
       ___________________________________________________________________
       (page generated 2022-10-24 23:01 UTC)