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

Ejemplares similares

Ejemplares similares