摘要
海量数据的快速匹配已经成为当前应用系统一个严峻问题,针对此问题展开深入讨论,将分布式技术与Bloom Filter技术有效结合,给出一种基于Bloom Filter的分布式快速匹配算法。与传统算法相比,此方法大大降低了程序对服务器内存的要求,同时提高了匹配效率,解决了制约应用程序运行效率的瓶颈问题。
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.
出处
《计算机与数字工程》
2011年第3期44-47,共4页
Computer & Digital Engineering
基金
国家十一五科技重大专项课题(编号:2009ZX1005-018)资助
