-
Notifications
You must be signed in to change notification settings - Fork 17
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
Reconsider hashing strategy #22
Comments
Blocked on #9 |
See https://en.m.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use Fibonacci Hashing: The Optimization That the World Forgot - https://news.ycombinator.com/item?id=17328756 |
Also see 5.2. in https://www.eecs.harvard.edu/~michaelm/postscripts/rsa2008.pdf |
32: Improve hashing r=crepererum a=crepererum Result: ![screenshot from 2018-08-25 18-57-43](https://user-images.githubusercontent.com/1529400/44620666-d2353d80-a898-11e8-97b2-a373c00130a5.png) See #22. Co-authored-by: Marco Neumann <[email protected]>
Fibonacci hashing won't work because the domain is of hash function we genera is not always a power of 2. But #32 improved the situation quite a bit, so I think this mission is complete for now. |
Right now, we use integer modulo hashing, which may have some serious consequences for hashing quality and performance. Evaluate if Fibonacci hashing would be an option.
The text was updated successfully, but these errors were encountered: