Ringed filters for peer-to-peer keyword searching

Yuichi Sei, Shinichi Honiden

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

1 Citation (Scopus)

Abstract

Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variablesize bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration, In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.

Original languageEnglish
Title of host publicationProceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
Pages772-779
Number of pages8
DOIs
Publication statusPublished - 2007 Dec 1
Externally publishedYes
Event16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 - Honolulu, HI,
Duration: 2007 Aug 132007 Aug 16

Other

Other16th International Conference on Computer Communications and Networks 2007, ICCCN 2007
CityHonolulu, HI,
Period07/8/1307/8/16

Fingerprint

Telecommunication traffic
Data structures
Experiments

Keywords

  • Bloom filter
  • Communication traffic
  • Data structure
  • Distributed hash table
  • False positive rate

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Sei, Y., & Honiden, S. (2007). Ringed filters for peer-to-peer keyword searching. In Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007 (pp. 772-779). [4317911] https://doi.org/10.1109/ICCCN.2007.4317911

Ringed filters for peer-to-peer keyword searching. / Sei, Yuichi; Honiden, Shinichi.

Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007. 2007. p. 772-779 4317911.

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

Sei, Y & Honiden, S 2007, Ringed filters for peer-to-peer keyword searching. in Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007., 4317911, pp. 772-779, 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007, Honolulu, HI, 07/8/13. https://doi.org/10.1109/ICCCN.2007.4317911
Sei Y, Honiden S. Ringed filters for peer-to-peer keyword searching. In Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007. 2007. p. 772-779. 4317911 https://doi.org/10.1109/ICCCN.2007.4317911
Sei, Yuichi ; Honiden, Shinichi. / Ringed filters for peer-to-peer keyword searching. Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007. 2007. pp. 772-779
@inproceedings{564334d1d74b41a38549cfbb3717f34b,
title = "Ringed filters for peer-to-peer keyword searching",
abstract = "Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variablesize bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration, In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.",
keywords = "Bloom filter, Communication traffic, Data structure, Distributed hash table, False positive rate",
author = "Yuichi Sei and Shinichi Honiden",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ICCCN.2007.4317911",
language = "English",
isbn = "9781424412518",
pages = "772--779",
booktitle = "Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007",

}

TY - GEN

T1 - Ringed filters for peer-to-peer keyword searching

AU - Sei, Yuichi

AU - Honiden, Shinichi

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variablesize bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration, In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.

AB - Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variablesize bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration, In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.

KW - Bloom filter

KW - Communication traffic

KW - Data structure

KW - Distributed hash table

KW - False positive rate

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

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

U2 - 10.1109/ICCCN.2007.4317911

DO - 10.1109/ICCCN.2007.4317911

M3 - Conference contribution

SN - 9781424412518

SP - 772

EP - 779

BT - Proceedings of 16th International Conference on Computer Communications and Networks 2007, ICCCN 2007

ER -