3 ms·
One way to do this is to send a bloom filter as index and then return the elements that are not part of the bloom filter.
by the8472 8y ago
One way to do this is to send a bloom filter as index and then return the elements that are not part of the bloom filter.
- jpitz 8y agoBut what about the false positives?
- jwhitlark 8y agoWell, I would assume the receiving node would verify that each entry was actually needed.
- jpitz 8y agoAren't the false positives in this situation representative of set elements that node b thinks that node a has but really does not?
- the8472 8y agoRight, the solution I remembered was a bit more complex, it required counting bloom filters and a subtraction operation to get a filter for the set difference. But the paper mentioned in a sibling comment claims to have even less overhead.