Bloom filter variants for multiple sets: a comparative assessment
In this paper we compare two probabilistic data structures for association queries derived from the well-known Bloom filter: the shifting Bloom filter (ShBF), and the spatial Bloom filter (SBF).With respect to the original data structure, Grinding Disc both variants add the ability to store multiple subsets in the same filter, using different strat