implement 8-bit fuse xor filters #13
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This commit adds a `Fuse8` filter, a xor filter with 8-bit fingerprints that uses the [fuse graph](https://arxiv.org/abs/1907.04749) data structure to achieves better space ratios than the `Xor8` filter (and is probably faster to populate). The implementation is very similar to the C one, which was added in FastFilter/xor_singleheader@4392b5e. `Fuse8` filters require a large number of keys (> 100_000), but have the same false positive percentage as `Xor8` filters (< 0.4%) while using much less space (~9.1 bits/entry as compared to `Xor8`'s ~9.9 bits/entry). 16-bit fingerprint versions of the xor filter using fuse graphs should be trivial to implement. Closes FastFilter#8
ayazhafiz
added a commit
to ayazhafiz/xorf
that referenced
this pull request
Dec 27, 2019
This commit adds `Fuse8` and `Fuse16` filters, xor filters with 8-bit and 16-bit fingerprints that uses the fuse graph data structure to achieve better space ratios than the `Xor8`/`Xor16` filters (and are faster to populate). The implementation is very similar to the go one, located to FastFilter/xorfilter#13. Fuse filters require a large number of keys (> 100_000), but have the same false positive percentage as Xor filters while using much less space (`Fuse8` uses ~9.1 bits/entry as compared to `Xor8`'s ~9.9 bits/entry). This commit also refactors the BTS/macro implementations of the filters to be contained in a new `prelude` module with submodules rather than all in a singular file. This allows pseudo-namespacing of filter implementation macros, like `xor_from_impl`.
ayazhafiz
added a commit
to ayazhafiz/xorf
that referenced
this pull request
Dec 27, 2019
This commit adds `Fuse8` and `Fuse16` filters, xor filters with 8-bit and 16-bit fingerprints that uses the fuse graph data structure to achieve better space ratios than the `Xor8`/`Xor16` filters (and are faster to populate). The implementation is very similar to the go one, located to FastFilter/xorfilter#13. Fuse filters require a large number of keys (> 100_000), but have the same false positive percentage as Xor filters while using much less space (`Fuse8` uses ~9.1 bits/entry as compared to `Xor8`'s ~9.9 bits/entry). This commit also refactors the BTS/macro implementations of the filters to be contained in a new `prelude` module with submodules rather than all in a singular file. This allows pseudo-namespacing of filter implementation macros, like `xor_from_impl`.
Member
|
I am not forgetting about this. On my todo. It looks exciting. |
Member
|
Merging. |
Member
|
Looks great! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This commit adds a
Fuse8filter, a xor filter with 8-bit fingerprintsthat uses the fuse graph data structure
to achieves better space ratios than the
Xor8filter (and is probablyfaster to populate). The implementation is very similar to the C one,
which was added in FastFilter/xor_singleheader@4392b5e.
Fuse8filters require a large number of keys (> 100_000), but have thesame false positive percentage as
Xor8filters (< 0.4%) while using muchless space (~9.1 bits/entry as compared to
Xor8's ~9.9 bits/entry).16-bit fingerprint versions of the xor filter using fuse graphs should
be trivial to implement.
Closes #8