Determine whether the element exists in the collection (using Bloom filter)

Tao song is still the same 2020-11-13 06:21:48
determine element exists collection using


      Original published in :

 

 

      today , Let's talk Bloom Filter, It is 1970 Year by year Bloom Invented , When determining whether an element exists in a collection , It has a wide range of applications .

 

      In the front of the written interview questions analysis , We introduced bitmap Principle :

       Written interview questions : Find the intersection of integers ( Use bitmap)

 

      Use bitmap We can judge whether a nonnegative integer exists in the set , We need to 512M To mark all nonnegative integers (4 Byte unsigned integer ), as follows :

 

      stay bitmap in , If you want to mark n, It's actually at the n individual bit Bit mark 1, there hash Function is actually hash(x)=x, There will never be hash Conflict .

      therefore , For a given set of nonnegative integers S for , Traversable S The nonnegative integer in , And mark them one by one bitmap in . For a given nonnegative integer k, Direct access to BitMap[k] Value , According to this value is 0 still 1, You can judge k Does it exist in S in .

       

      However , If the target object is a string , What shall I do? ?  Obviously not hash(x)=x such hash function , Instead, we should transform the string into a non negative integer , as follows :

 

      You can see , adopt hash function , Strings can also be marked to bitmap in . and , You can choose a reasonable hash function , To control hash The range of values , There is no need to let hash It's worth as much as 4294967295, So as to save space greatly .

       therefore , For a given set of strings S for , Traversable S String in , And put the corresponding hash Values are marked to bitmap in . For a given string str, Direct access to hash(str) Corresponding bitmap Value , According to this value is 0 still 1, You can judge str Does it exist in S in .

 

      However , When string sets S When there are more elements in , After mapping to a nonnegative integer , There must be hash Conflict , And it can't be avoided , such as , May appear hash("xyz") and hash("abc") The values of are just 4, So it's impossible to judge "xyz" Does it exist in S in , What shall I do? ?

      Since once hash Easy to conflict , Then consider introducing many times hash, The probability of multiple simultaneous conflicts is much lower , This is it. Bloom Filter Thought :

 

      therefore , For a given set of strings S for , Traversable S String in , And put each string corresponding to hash1、hash2 and hash3 The values of are marked with bitmap in . For a given string str, Direct access to hash1(str)、hash2(str) and hash3(str) Corresponding bitmap value , When this 3 individual bitmap Any one of the values is not 1 when , You know str It must not exist in S in . And when this 3 individual bitmap Values are 1 when , Think str Exist in S in ( Not at all 100% accuracy ).

      You can see , Above Bloom Filter There will be a certain rate of miscalculation , The false positive rate can be analyzed . For a given set S for , Just choose the right one hash Number of functions m and bitmap The length of n, You can make Bloom Filter Its accuracy is quite reliable , Specific mathematical analysis can refer to Mr. Wu Jun's 《 The beauty of Mathematics 》.

 

      introduce Bloom Filter after , Can tag strings , And it saves a lot of money bitmap Length and space , Just at the expense of some accuracy . In the related applications of big data , Will often see Bloom Filter The figure of .

 

版权声明
本文为[Tao song is still the same]所创,转载请带上原文链接,感谢

  1. [front end -- JavaScript] knowledge point (IV) -- memory leakage in the project (I)
  2. This mechanism in JS
  3. Vue 3.0 source code learning 1 --- rendering process of components
  4. Learning the realization of canvas and simple drawing
  5. gin里获取http请求过来的参数
  6. vue3的新特性
  7. Get the parameters from HTTP request in gin
  8. New features of vue3
  9. vue-cli 引入腾讯地图(最新 api,rocketmq原理面试
  10. Vue 学习笔记(3,免费Java高级工程师学习资源
  11. Vue 学习笔记(2,Java编程视频教程
  12. Vue cli introduces Tencent maps (the latest API, rocketmq)
  13. Vue learning notes (3, free Java senior engineer learning resources)
  14. Vue learning notes (2, Java programming video tutorial)
  15. 【Vue】—props属性
  16. 【Vue】—创建组件
  17. [Vue] - props attribute
  18. [Vue] - create component
  19. 浅谈vue响应式原理及发布订阅模式和观察者模式
  20. On Vue responsive principle, publish subscribe mode and observer mode
  21. 浅谈vue响应式原理及发布订阅模式和观察者模式
  22. On Vue responsive principle, publish subscribe mode and observer mode
  23. Xiaobai can understand it. It only takes 4 steps to solve the problem of Vue keep alive cache component
  24. Publish, subscribe and observer of design patterns
  25. Summary of common content added in ES6 + (II)
  26. No.8 Vue element admin learning (III) vuex learning and login method analysis
  27. Write a mini webpack project construction tool
  28. Shopping cart (front-end static page preparation)
  29. Introduction to the fluent platform
  30. Webpack5 cache
  31. The difference between drop-down box select option and datalist
  32. CSS review (III)
  33. Node.js学习笔记【七】
  34. Node.js learning notes [VII]
  35. Vue Router根据后台数据加载不同的组件(思考->实现->不止于实现)
  36. Vue router loads different components according to background data (thinking - & gt; Implementation - & gt; (more than implementation)
  37. 【JQuery框架,Java编程教程视频下载
  38. [jQuery framework, Java programming tutorial video download
  39. Vue Router根据后台数据加载不同的组件(思考->实现->不止于实现)
  40. Vue router loads different components according to background data (thinking - & gt; Implementation - & gt; (more than implementation)
  41. 【Vue,阿里P8大佬亲自教你
  42. 【Vue基础知识总结 5,字节跳动算法工程师面试经验
  43. [Vue, Ali P8 teaches you personally
  44. [Vue basic knowledge summary 5. Interview experience of byte beating Algorithm Engineer
  45. 【问题记录】- 谷歌浏览器 Html生成PDF
  46. [problem record] - PDF generated by Google browser HTML
  47. 【问题记录】- 谷歌浏览器 Html生成PDF
  48. [problem record] - PDF generated by Google browser HTML
  49. 【JavaScript】查漏补缺 —数组中reduce()方法
  50. [JavaScript] leak checking and defect filling - reduce() method in array
  51. 【重识 HTML (3),350道Java面试真题分享
  52. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  53. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  54. [re recognize HTML (3) and share 350 real Java interview questions
  55. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  56. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  57. 【重识 HTML ,nginx面试题阿里
  58. 【重识 HTML (4),ELK原来这么简单
  59. [re recognize HTML, nginx interview questions]
  60. [re recognize HTML (4). Elk is so simple