@Rajarshi -- in reality its not clear how to efficiently hash to uniform random positions.But its a good model for what would happen if you use like a cryptographic hash function where the output is pretty 'random' given the input
makes sense. thanks
@raghav I'm not sure they have compared these approaches theoretically. I think it might get a bit complex? You would also imagine even more complex variants. Like sandwiched paritioned filters. But optimizing the parameters there I guess could get really complex.
I see, that suggests that there should be some limitation of repeatedly using bloom filters right?
I think there should be? Although I'm not sure.
I see -thanks!
Thank you and happy holidays everybody!