Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
layoutIfNeeded
on Dec 20, 2019
|
parent
|
context
|
favorite
| on:
Xor Filters: Faster and Smaller Than Bloom Filters
Interesting. Where does 3 come from for the number of hash functions? Why not 4 or 5?
fixf
on Dec 20, 2019
[–]
The minimum number motivated to work is also the cheapest. 2 was simply deemed insecure.
thomasmg
on Dec 20, 2019
|
parent
|
next
[–]
No, actually 2 would also work. It's just that 3 hash functions needs the least space for some reason (less than 2, less than 4 or more).
fixf
on Dec 20, 2019
|
root
|
parent
|
next
[–]
Well met, and thanks for identifying the solution using overhead.
layoutIfNeeded
on Dec 20, 2019
|
parent
|
prev
[–]
Insecure? What does that mean in the context of a read-only data structure?
fixf
on Dec 20, 2019
|
root
|
parent
[–]
Good point, loose language on my part. I am thinking of false positives or collision. The required statistical properties aren't met.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
