A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters

この論文にアクセスする

この論文をさがす

著者

    • ARIYOSHI Takahiro
    • the Department of Information Engineering, Graduate School of Engineering, Hiroshima University
    • FUJITA Satoshi
    • the Department of Information Engineering, Graduate School of Engineering, Hiroshima University

抄録

In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on Distributed Hash Tables (P2P DHT, for short). The basic idea of our approach is to <i>cache</i> the search result for the queries submitted in the past, and to use them to improve the performance of succeeding query processing. More concretely, we propose to adopt Bloom filters as a concrete implementation of such a result cache rather than a list of items used in many conventional schemes. By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that the proposed scheme is particularly effective when the size of available memory in each peer is bounded by a small value, and when the number of peers is 100, it reduces the amount of data transmissions of previous schemes by 75%.

収録刊行物

  • IEICE transactions on information and systems

    IEICE transactions on information and systems 94(8), 1602-1609, 2011-08-01

    一般社団法人 電子情報通信学会

参考文献:  8件中 1-8件 を表示

各種コード

  • NII論文ID(NAID)
    10030192510
  • NII書誌ID(NCID)
    AA10826272
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    09168532
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ