Computer scientists of Twitter -- is there a more efficient probabilistic data structure that can act as a inverse bloom filter (false negatives possible but never false positives) besides a cache with LRU eviction that only stores keys?
Conversation
Replying to
Not sure but there is data saved on one of your platforms I'd like deleted but you're not addressing DMs. You are aware of GDPR complicance right?
1
1
Replying to
If I missed a removal request, I apologize. I am working through a backlog of many DMs but I'd be happy to speak with you now via DM.
1
Show replies
Replying to
Since the full key must be retained (collisions => false positives), your intuition is correct that something LRU-like is necessary. A hash table storing the keys that overwrites on collision would be fast, or maybe a cuckoo hash variant to up the load factor/memory efficiency.