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

Bloom Filter及其应用综述
引用本文:肖明忠 代亚非. Bloom Filter及其应用综述[J]. 计算机科学, 2004, 31(4): 180-183
作者姓名:肖明忠 代亚非
作者单位:北京大学计算机科学技术系,北京,100871;北京大学计算机科学技术系,北京,100871
基金项目:国家重点基础研究发展规划973资助项目(G1999032706),国家863高科技发展计划资助项目(2001AA111013)
摘    要:Bloom Filter对数据集合采用一个位串表示并能有效支持集合元素的哈希查找操作。本文对Bloom Filter及其改进型进行了综述性分析研究.探讨了它的实用性。较为详细地阐述了它在P2P网络文件存储系统OceanStore和文本检索系统中的应用情况。最后指出了进一步的研究方向。

关 键 词:Bloom Filter  哈希查找

A Survey on Bloom Filters and its Applications
XIAO Ming-Zhong DAI Ya-Fei. A Survey on Bloom Filters and its Applications[J]. Computer Science, 2004, 31(4): 180-183
Authors:XIAO Ming-Zhong DAI Ya-Fei
Abstract:Representation and location of information play a key role in many applications and the two processes are very related. Bloom Filter uses a bit strings to represent a data set and is able to locate an element in the set by the way of hash functions. This paper surveys all kinds of Bloom Filter .discusses their practicability and describes in detail their application on OceanStore system and text-retrieval system. Finally,some advices about future works are given.
Keywords:Bloom filters   Hashing locate  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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