作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (7): 264-266. doi: 10.3969/j.issn.1000-3428.2009.07.092

• 开发研究与设计技术 • 上一篇    下一篇

Bloom搜索过滤器的优化设计与实现

高家利1,廖晓峰2   

  1. (1. 重庆工学院工程训练中心,重庆 400054;2. 重庆大学计算机学院,重庆 400044)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-05 发布日期:2009-04-05

Optimized Design and Implementation of Bloom Filter

GAO Jia-li1, LIAO Xiao-feng2   

  1. (1. Engineering Training Center, Chongqing Institute of Technology, Chongqing 400054;
    2. Computer College, Chongqing University, Chongqing 400044)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-05 Published:2009-04-05

摘要: 基于Bloom搜索过滤器的搜索过滤机制会发生误判,且在查询目标进入过滤器后,查询整个关键字的步骤会耗费太多成本。该文提出一套新的搜索过滤器架构。经实验验证,该过滤器能减少误判率的发生,降低整个过滤器的搜索成本,提高搜索过滤器的整体性能。

关键词: Bloom搜索过滤器, 关键字集合, 误判, 查表目录

Abstract: Bloom filter based filtering mechanisms have one major drawback, that is, after a query item passes through the filter, the entire key set has to be searched ever for false positives. The search cost is therefore bound to be higher than necessary. This paper developes a new search filter which can lower the possibly of false positives, and significantly reduce the overall search cost, since a large amount of unnecessary search operations can be avoided.

Key words: Bloom filter, key set, false positive, lookup table

中图分类号: