patelprateek commented on issue #414: URL: https://github.com/apache/datasketches-java/issues/414#issuecomment-1252968647
yes inclusion exclusion would be one way to compute intersection , i was suggesting the de-morgans law if we were able to store the negation of the sets as well . I thought the reason inclusion-exclusion didnt work well was because it has 4 approximation error components : |a| , |b| , union(a, b) and then adding subtracting these components , but if we were to do just one union , HLL++ usually work really well , so i was thinking if i can store HLL for a and HLL for ~a (not(a)) , i might be able to get away with just one union , which works well for hll ? -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
