Skip to content
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

Using SipHash ? #30

Open
ellipticasec opened this issue Jan 3, 2018 · 2 comments
Open

Using SipHash ? #30

ellipticasec opened this issue Jan 3, 2018 · 2 comments

Comments

@ellipticasec
Copy link

First of all, please excuse my possibly ignorant question as I'm not a CS guy - more of an engineer, and so I don't fully understand your academic paper.

I see that the class can be instantiated with any of the hashing functions and that by default you use a TwoIndependentMultiplyShift which appears to be an extremely efficient Universal Hashing algorithm.

What do you think of using SipHash? Do you think it would have a positive or negative impact on the effectiveness of the Cuckoo filter, its performance and overall properties?

@jbapple
Copy link

jbapple commented Dec 15, 2019

SipHash is quite slow compared to TwoIndependentMultiplyShift, but the resultant hash values would be more "random-looking", and so maximum fill factor might increase.

@burdges
Copy link

burdges commented Dec 15, 2019

I think cuckoo filters are slightly more susceptible to hash collisions than linear probing based hash table designs, so you should demand better randomness properties from your hash function than you might accept from a linear probing based hash table.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants