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

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Sei, Yuichi, Matsuzaki, Kazutaka, Honiden, Shinichi
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24382
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-24382
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
spellingShingle Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
Sei, Yuichi
Matsuzaki, Kazutaka
Honiden, Shinichi
An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
topic_facet Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
description 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.
format Objeto de conferencia
Objeto de conferencia
author Sei, Yuichi
Matsuzaki, Kazutaka
Honiden, Shinichi
author_facet Sei, Yuichi
Matsuzaki, Kazutaka
Honiden, Shinichi
author_sort Sei, Yuichi
title An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
title_short An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
title_full An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
title_fullStr An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
title_full_unstemmed An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
title_sort algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/24382
work_keys_str_mv AT seiyuichi analgorithmtoreducethecommunicationtrafficformultiwordsearchesinadistributedhashtable
AT matsuzakikazutaka analgorithmtoreducethecommunicationtrafficformultiwordsearchesinadistributedhashtable
AT honidenshinichi analgorithmtoreducethecommunicationtrafficformultiwordsearchesinadistributedhashtable
AT seiyuichi algorithmtoreducethecommunicationtrafficformultiwordsearchesinadistributedhashtable
AT matsuzakikazutaka algorithmtoreducethecommunicationtrafficformultiwordsearchesinadistributedhashtable
AT honidenshinichi algorithmtoreducethecommunicationtrafficformultiwordsearchesinadistributedhashtable
bdutipo_str Repositorios
_version_ 1764820467050348547

Ejemplares similares