期刊信息

  • 刊名: 河北师范大学学报(自然科学版)Journal of Hebei Normal University (Natural Science)
  • 主办: 河北师范大学
  • ISSN: 1000-5854
  • CN: 13-1061/N
  • 中国科技核心期刊
  • 中国期刊方阵入选期刊
  • 中国高校优秀科技期刊
  • 华北优秀期刊
  • 河北省优秀科技期刊

Bloom Filter和Weighted Bloom Filter的比较与研究

  • 1. 河北工程大学 信息与电器工程学院, 河北 邯郸 056038;
    2. 石家庄第 1 职业中专, 河北 石家庄 050001
  • DOI:

Bloom Filter VS Weighted Bloom Filter

摘要/Abstract

摘要:

Bloom filter是一个简单的空间效率极高的数据结构,用于判别一个元素是否属于某个集合.Weighted Bloom filter和Bloom filter已经被建议作为共享Web cache信息的一种方式.利用Bloom filter表示共享信息的内容,大大降低了用于存储索引的空间消耗,减少了访问延迟.因为在代理之间只需传输Bloom filter而不是完整的cache目录表.分别从理论和实践方面比较了Bloom filter和Weighted Bloom filter,结果证明Bloom filter比Weighted Bloom filter更好.

Abstract:

A Bloom filter is a simple space-efficient data structure for representing a set in order to determine a certain element in the set.Weighted Bloom filter and Bloom filter have been suggested as a means for sharing Web cache information.The contents of shared message are represented by Bloom filter.This technique greatly reduces the space needed for page indexing and decrease the access delay.Because Bloom filters are transmitted among shared proxies instead of sending the full list of cache contents.A comparison of theory and practice between the Bloom filter and Weighted Bloom filter is given.It is proved that Bloom filter is better than Weighted Bloom filter.