Flexible bloom filters for searching textual objects

Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

研究成果: Conference contribution

抄録

Efficient object searching mechanisms are essential in large-scale networks. Many studies have been done on distributed hash tables (DHTs), which are a kind of peer-to-peer system. In DHT networks, we can certainly get the desired objects if they exist. However, multi-word searches generate much communication traffic. Many studies have tried to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. In using such filters, all nodes in a DHT must share their false positive rate parameter. However, the best false positive rate differs from one node to another. In this paper, we provide a method of determining the best false positive rate, and we use a new filter called a flexible bloom filter, to which each node can set the approximately best false positive rate. Experiments showed that the flexible bloom filter was able to greatly reduce the traffic.

本文言語English
ホスト出版物のタイトルAgents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers
ページ110-121
ページ数12
DOI
出版ステータスPublished - 2010 2 15
外部発表はい
イベント6th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2007 - Honululu, HI, United States
継続期間: 2007 5 142007 5 18

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5319 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other6th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2007
CountryUnited States
CityHonululu, HI
Period07/5/1407/5/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Flexible bloom filters for searching textual objects」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル