Flexible Bloom Filters for Searching Textual Objects

Authors:
Yuichi Sei;Kazutaka Matsuzaki;Shinichi Honiden
Affiliations:
The University of Tokyo, Japan;The University of Tokyo, Japan;The University of Tokyo, Japan and National Institute of Informatics, Japan
Venue:
Agents and Peer-to-Peer Computing
Year:
2009

Citing 10
Cited 0

Accessing textual documents using compressed indexes of arrays of small bloom filters

The Computer Journal
A fixed-size Bloom filter for searching textual documents

The Computer Journal
Parallel randomized load balancing

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Compressed bloom filters

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment

P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Efficient peer-to-peer keyword searching

Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware

Quantified Score

Hi-index	0.00

Visualization

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.