Add a variant of cuckoo filters in which buckets may overlap. #33
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 demonstrates lookup times that are as good as cuckoo filter lookup times, or better, while having space usage close to that of the semi-sorted cuckoo filter. This is based on Lehman, Eric, and Rina Panigrahy. "3.5-way cuckoo hashing for the price of 2-and-a-bit." European Symposium on Algorithms. Springer, Berlin, Heidelberg, 2009.
|
FYI as a side note: The underlying cuckoo hashing has also been understood theoretically (see Stefan Walzer, "Load Thresholds for Cuckoo Hashing with Overlapping Blocks", ICALP 2018, preprint). |
|
@dave-andersen Do you have time for a code review? |
|
@apc999 do you have time to do a code review? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 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 demonstrates lookup times that are as good as cuckoo filter
lookup times, or better, while having space usage close to that of the
semi-sorted cuckoo filter.
This is based on Lehman, Eric, and Rina Panigrahy. "3.5-way cuckoo
hashing for the price of 2-and-a-bit." European Symposium on
Algorithms. Springer, Berlin, Heidelberg, 2009.