Flexible bloom filters for searching textual objects

Yuichi Sei*, Kazutaka Matsuzaki, Shinichi Honiden

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Efficient object searching mechanisms are essential in large-scale networks. Many studies have been done on distributed hash tables (DHTs), which are a kind of peer-to-peer system. In DHT networks, we can certainly get the desired objects if they exist. However, multi-word searches generate much communication traffic. Many studies have tried to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. In using such filters, all nodes in a DHT must share their false positive rate parameter. However, the best false positive rate differs from one node to another. In this paper, we provide a method of determining the best false positive rate, and we use a new filter called a flexible bloom filter, to which each node can set the approximately best false positive rate. Experiments showed that the flexible bloom filter was able to greatly reduce the traffic.

Original languageEnglish
Title of host publicationAgents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers
Number of pages12
Publication statusPublished - 2010
Externally publishedYes
Event6th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2007 - Honululu, HI, United States
Duration: 2007 May 142007 May 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5319 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other6th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2007
Country/TerritoryUnited States
CityHonululu, HI

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Flexible bloom filters for searching textual objects'. Together they form a unique fingerprint.

Cite this