Ringed filters for peer-to-peer keyword searching

Yuichi Sei, Shinichi Honiden

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variablesize bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration, In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.

本文言語English
ホスト出版物のタイトルProceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
ページ772-779
ページ数8
DOI
出版ステータスPublished - 2007
外部発表はい
イベント16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 - Honolulu, HI, United States
継続期間: 2007 8 132007 8 16

出版物シリーズ

名前Proceedings - International Conference on Computer Communications and Networks, ICCCN
ISSN(印刷版)1095-2055

Conference

Conference16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
国/地域United States
CityHonolulu, HI,
Period07/8/1307/8/16

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル