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

Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationFourth IFIP International Conference on Theoretical Computer Science- TCS 2006
Subtitle of host publicationIFIP 19th Worm Computer Congress, TC-1, Foundations of Computer Science, August 23-24, 2006, Santiago Chile
Pages115-129
Number of pages15
DOIs
Publication statusPublished - 2006 Dec 27
Externally publishedYes

Publication series

NameIFIP International Federation for Information Processing
Volume209
ISSN (Print)1571-5736

    Fingerprint

ASJC Scopus subject areas

  • Information Systems and Management

Cite this

Sei, Y., Matsuzaki, K., & Honiden, S. (2006). An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table. In 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 (pp. 115-129). (IFIP International Federation for Information Processing; Vol. 209). https://doi.org/10.1007/978-0-387-34735-6_13