Efficient peer-to-peer keyword searching

  • Authors:
  • Patrick Reynolds;Amin Vahdat

  • Affiliations:
  • Duke University;Duke University

  • Venue:
  • Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The recent file storage applications built on top of peer-to-peer distributed hash tables lack search capabilities. We believe that search is an important part of any document publication system. To that end, we have designed and analyzed a distributed search engine based on a distributed hash table. Our simulation results predict that our search engine can answer an average query in under one second, using under one kilobyte of bandwidth.