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

Autores
Sei, Yuichi; Matsuzaki, Kazutaka; Honiden, Shinichi
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/24382
Acceder
id SEDICI_f805107e2d4facefba7beed12136000e
oai_identifier_str oai:sedici.unlp.edu.ar:10915/24382
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling An algorithm to reduce the communication traffic for multi-word searches in a distributed hash tableSei, YuichiMatsuzaki, KazutakaHoniden, ShinichiCiencias InformáticasHash-table representationsFilteringProbabilistic computationDistributed networksbloom filterIn 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.4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24382enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T16:37:23Zoai:sedici.unlp.edu.ar:10915/24382Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 16:37:23.505SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
title An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
spellingShingle An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
Sei, Yuichi
Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
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 An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table
dc.creator.none.fl_str_mv Sei, Yuichi
Matsuzaki, Kazutaka
Honiden, Shinichi
author Sei, Yuichi
author_facet Sei, Yuichi
Matsuzaki, Kazutaka
Honiden, Shinichi
author_role author
author2 Matsuzaki, Kazutaka
Honiden, Shinichi
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
topic Ciencias Informáticas
Hash-table representations
Filtering
Probabilistic computation
Distributed networks
bloom filter
dc.description.none.fl_txt_mv 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.
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/24382
url http://sedici.unlp.edu.ar/handle/10915/24382
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846782835920207872
score 12.982451

Publicaciones similares