An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table

Yuichi Sei*, Kazutaka Matsuzaki, Shinichi Honiden

*この研究の対応する著者

研究成果: Chapter

3 被引用数 (Scopus)

抄録

In distributed hash tables, much communication traffic comes from multi-word searches. The aim of this work is to reduce the amount of traffic by using a bloom filter, which is a space-efficient probabilistic data structure used to test whether or not an element is a member of a set. However, bloom filters have a limited role if several sets have different numbers of elements. In the proposed method, extra data storage is generated when contents' keys are registered in a distributed hash table system. Accordingly, we propose a "divided bloom filter" to solve the problem of a normal bloom filter. Using the divided bloom filter, we aim to reduce both the amount of communication traffic and the amount of data storage.

本文言語English
ホスト出版物のタイトルFourth IFIP International Conference on Theoretical Computer Science- TCS 2006
ホスト出版物のサブタイトルIFIP 19th Worm Computer Congress, TC-1, Foundations of Computer Science, August 23-24, 2006, Santiago Chile
編集者Gonzalo Navarro, Leopolo Bertossi, Yoshiharu Kohayakawa
ページ115-129
ページ数15
DOI
出版ステータスPublished - 2006
外部発表はい

出版物シリーズ

名前IFIP International Federation for Information Processing
209
ISSN(印刷版)1571-5736

ASJC Scopus subject areas

  • 情報システムおよび情報管理

フィンガープリント

「An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル