| Bloom Filters散列函数数目多阶段动态优化算法 |
| |
| 引用本文： | 张伟,王汝传.Bloom Filters散列函数数目多阶段动态优化算法[J].电子学报,2011,39(4):877-882. |
| |
| 作者姓名： | 张伟 王汝传 |
| |
| 作者单位： | 南京邮电大学计算机学院,江苏南京210003;南京邮电大学计算机技术研究所,江苏南京210003 |
| |
| 基金项目： | 国家自然科学基金，江苏省自然科学基金，省级现代服务业发展专项基金，国家博士后基金，江苏高校科技创新计划项目，江苏省六大高峰人才项目，江苏省计算机信息处理技术重点实验室基金 |
| |
| 摘 要： | 标准Bloom Filters在操作前需要知道数据集合中不同元素数目才能确定最佳的Hash函数数目,但是数据集的分布情况并不容易事先获得.本文提出一种多阶段Hash函数数目动态优化的Bloom Filters(Multi-stage Dynamic optimization Bloom Filters,MDBF),它将...
|
| 关 键 词： | Bloom Filters hash函数 偏斜分布 误检率 |
| 收稿时间： | 2008-09-25 |
A Multi-Stage Dynamic Optimization Algorithm for Bloom Filters Hash Functions Number |
| |
| ZHANG Wei,WANG Ru-chuan.A Multi-Stage Dynamic Optimization Algorithm for Bloom Filters Hash Functions Number[J].Acta Electronica Sinica,2011,39(4):877-882. |
| |
| Authors: | ZHANG Wei WANG Ru-chuan |
| |
| Affiliation: | 1. College of Computer,Nanjing University of Posts &; Telecommunications,Nanjing,Jiangsu 210003,China;2. Institute of Computer Technology,Nanjing University of Posts &; Telecommunications,Nanjing,Jiangsu 210003,China |
| |
| Abstract: | Standard Bloom Filters needs to know the number of different elements in data set in order to determine the optimal number of hash functions.However,the data distribution information is not easy to obtain prior.This paper proposes a multi-stage dynamic optimization for Bloom Filters hash functions number (MDBF).It splits element insertion procedure into several stages,and in each stage of element insertion,MDBF decides the optimal hash function number by analyzing the inserted data distribution with bit vector usage situation.The experimental results show that MDBF can select the optimal number of hash functions to obtain low false positive probability in complicated applications,which have element multiplicity and skewed distribution. |
| |
| Keywords: | bloom filters hash function skewed distribution false positive probability |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
