湖南大学学报（自然科学版）2018，Vol.45Issue(2)：133-140,8.DOI:10.16339/j.cnki.hdxbzkb.2018.02.17
多路平衡型矩阵Bloom Filter
M-Balance Matrix Bloom Filter
摘要
Abstract
Aiming at solving the representation and query efficiency in massive and dynamic dataset on storage system,a Multi-group Balance Matrix Bloom Filter (M-BMBF)and the algorithms on insertion and searching of data element were proposed.M-BMBF initiates a r×m matrix Bloom filter according to the size of dataset,and it introduces multiple located hash functions which can be used to divide the matrix Bloom filter into multi-group to achieve balanced insertion and efficient query operations.In order to slow down the bits consumption rate in Bloom filter when a new element is inserted,a longest-bit match filling algorithm was proposed,which selects a Bloom filter as the destination position for insertion from the can-didate Bloom filters according to the rule that fewest bits will be changed due to this insertion operation. Experiment results show that compared with the classical Split Bloom Filter,M-BMBF can efficiently save storage space and decrease the misj udgment rate,while its time consume is constant.关键词
海量数据存储/BloomFilter/拆分BloomFilter/多路平衡型矩阵BloomFilterKey words
mass data storage/Bloom Filter/split Bloom Filter/M-balance matrix Bloom Filter分类
信息技术与安全科学引用本文复制引用
杨磊,黄建智..多路平衡型矩阵Bloom Filter[J].湖南大学学报（自然科学版）,2018,45(2):133-140,8.基金项目
国家重点研发计划"高性能计算"专项资助项目(2017YFB0202901),The National Key Research and Development Program of China(2017YFB0202901) （2017YFB0202901）
湖南省自然科学基金资助项目(2015JJ2035),National Natural Science Foundation of Hunan Province(2015JJ2035) （2015JJ2035）
中央高校基本科研业务费资助项目,The Fundamental Research Funds for the Central Universities （）
