Status: Assigned Owner: [email protected] CC: [email protected], [email protected] Labels: Type-Bug Pri-2 OS-All Area-Misc Size-Medium
New issue 10634 by [email protected]: Examine the performance of our bloom filter hash functions http://code.google.com/p/chromium/issues/detail?id=10634 The hash functions used in the SafeBrowsing bloom filters should be examined for possible reductions in their false positive rate. Our current implementation uses four hash functions on a filter of varying size. We want to make sure that we don't increase the computational expense of the functions, as they are in a code path that directly impacts the latency experienced by the end user. A possibility for a global reduction in the false positive rate is to use a random seed in the hash functions so that users with the exact same SafeBrowsing data but different seeds will not end up with the same bloom filter. See http://crbug.com/10584 for more details about the importance of keeping the false positive rate the bloom filters as low as possible. -- You received this message because you are listed in the owner or CC fields of this issue, or because you starred this issue. You may adjust your issue notification preferences at: http://code.google.com/hosting/settings --~--~---------~--~----~------------~-------~--~----~ Automated mail from issue updates at http://crbug.com/ Subscription options: http://groups.google.com/group/chromium-bugs -~----------~----~----~----~------~----~------~--~---
