-
Notifications
You must be signed in to change notification settings - Fork 29
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
XorBinaryFuse8 failed to construct on some data #31
Comments
Yes, here the paper that contains all the theory about the fuse approach: https://arxiv.org/abs/1907.04749 - it doesn't describe the construction algorithm we use here I'm afraid, but it explains the theory. |
The code that fails is a copy of the code from https://github.com/FastFilter/fastfilter_cpp/blob/master/src/xorfilter/3wise_xor_binary_fuse_filter_lowmem.h#L142 - I will try to find out what's going on here. |
Hm, I found the problem: if mapping fails, then we forget to do reverseOrder[size] = 1 (this is done correctly in the C / C++ code). But now there's another problem: the array size is too small. I'll try to fix that as well. |
Could you verify it is fixed now please? |
I find it is not fixed, this is another construction failure:
will report:
|
Execute this code will report:
Is there any paper/draft can help understand xor binary fuse algorithm?
The text was updated successfully, but these errors were encountered: