MultiIndex bloom filters are like counting bloom filters but do store values rather than counts. Unlike Bloomier filters, they do not use perfect hashing. More space efficient depending on k used than a hash table but may not be an ideal data-structure for 1 to many classifications because of value storage redundancy.
MultiIndex bloom filters are like counting bloom filters but do store values rather than counts. Unlike Bloomier filters, they do not use perfect hashing. More space efficient depending on k used than a hash table but may not be an ideal data-structure for 1 to many classifications because of value storage redundancy.