New answers tagged database-theory
0
if you map every element in set in S into a bit in a binary number. For set with n elements, we have n bit binary number. the $i$-th number takes 1 if the subset has that element. Then we can use a binary number from $00,...,00$ to $11,...,11$ to represent all the subset.
If you map all your subset into binary numbers, then you are searching in the number ...
1
I am not able to clearly understand your use case, but from what I infer I believe if you are trying to de-dupe data on other features, the approach would be to use LSH(Locality Sensitive Hashing) you can see the following links to get an overview. hope this helps.
https://stackoverflow.com/questions/12952729/how-to-understand-locality-sensitive-hashing
...
Top 50 recent answers are included
