Flexible bloom filters for searching textual objects

Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

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

Abstract

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
Pages110-121
Number of pages12
DOIs
Publication statusPublished - 2010 Feb 15
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

Other

Other6th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2007
CountryUnited States
CityHonululu, HI
Period07/5/1407/5/18

Fingerprint

Bloom Filter
False Positive
Telecommunication traffic
Data structures
Tables
Traffic
Vertex of a graph
Experiments
Filter
Peer-to-peer Systems
Data Structures
Object
Experiment

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sei, Y., Matsuzaki, K., & Honiden, S. (2010). Flexible bloom filters for searching textual objects. In Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers (pp. 110-121). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5319 LNAI). https://doi.org/10.1007/978-3-642-11368-0_9

Flexible bloom filters for searching textual objects. / Sei, Yuichi; Matsuzaki, Kazutaka; Honiden, Shinichi.

Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers. 2010. p. 110-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5319 LNAI).

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

Sei, Y, Matsuzaki, K & Honiden, S 2010, Flexible bloom filters for searching textual objects. in Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5319 LNAI, pp. 110-121, 6th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2007, Honululu, HI, United States, 07/5/14. https://doi.org/10.1007/978-3-642-11368-0_9
Sei Y, Matsuzaki K, Honiden S. Flexible bloom filters for searching textual objects. In Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers. 2010. p. 110-121. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-11368-0_9
Sei, Yuichi ; Matsuzaki, Kazutaka ; Honiden, Shinichi. / Flexible bloom filters for searching textual objects. Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers. 2010. pp. 110-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b6079cafd47a424389b129cc21808fa6,
title = "Flexible bloom filters for searching textual objects",
abstract = "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.",
author = "Yuichi Sei and Kazutaka Matsuzaki and Shinichi Honiden",
year = "2010",
month = "2",
day = "15",
doi = "10.1007/978-3-642-11368-0_9",
language = "English",
isbn = "3642113672",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "110--121",
booktitle = "Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers",

}

TY - GEN

T1 - Flexible bloom filters for searching textual objects

AU - Sei, Yuichi

AU - Matsuzaki, Kazutaka

AU - Honiden, Shinichi

PY - 2010/2/15

Y1 - 2010/2/15

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

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

UR - http://www.scopus.com/inward/record.url?scp=76249098905&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76249098905&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-11368-0_9

DO - 10.1007/978-3-642-11368-0_9

M3 - Conference contribution

SN - 3642113672

SN - 9783642113673

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 110

EP - 121

BT - Agents and Peer-to-Peer Computing - 6th International Workshop, AP2PC 2007, Revised and Selected Papers

ER -