首页 | 本学科首页   官方微博 | 高级检索  
     

基于Bloom Filter的海量数据分布式快速匹配算法研究
引用本文:罗理,刘响光,胡振,周姣,张刚伟,李启平.基于Bloom Filter的海量数据分布式快速匹配算法研究[J].计算机与数字工程,2011,39(3):44-47.
作者姓名:罗理  刘响光  胡振  周姣  张刚伟  李启平
作者单位:湖南省长沙市中心医院信息科,长沙,410004
基金项目:国家十一五科技重大专项课题
摘    要:海量数据的快速匹配已经成为当前应用系统一个严峻问题,针对此问题展开深入讨论,将分布式技术与Bloom Filter技术有效结合,给出一种基于Bloom Filter的分布式快速匹配算法。与传统算法相比,此方法大大降低了程序对服务器内存的要求,同时提高了匹配效率,解决了制约应用程序运行效率的瓶颈问题。

关 键 词:BloomFilter  海量数据  分布式  快速匹配算法

Research on Massive Data Fast Matching Algorithm for Distributed Based on Bloom Filter
Luo Li,Liu Xiangguang,Hu Zhen,Zhou Jiao,Zhang Gangwei,Li Qiping.Research on Massive Data Fast Matching Algorithm for Distributed Based on Bloom Filter[J].Computer and Digital Engineering,2011,39(3):44-47.
Authors:Luo Li  Liu Xiangguang  Hu Zhen  Zhou Jiao  Zhang Gangwei  Li Qiping
Affiliation:Luo Li Liu Xiangguang Hu Zhen Zhou Jiao Zhang Gangwei Li Qiping(Department of Information,Changsha Central Hospital,Changsha 410004)
Abstract:Fast matching for massive data has become a serious problem of application system.This issue is discussed in this paper,distributed technology combine effectively and Bloom Filter,is proposed a based on Bloom Filter distributed fast matching algorithm.Solve the bottleneck problem of restricting the efficiency of application running.
Keywords:Bloom Filter
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号