Finding Rare Data Objects in P2P File-Sharing Systems

  • Authors:
  • Wai Gen Yee;Dongmei Jia;Ophir Frieder

  • Affiliations:
  • Illinois Institute of Technology;Illinois Institute of Technology;Illinois Institute of Technology

  • Venue:
  • P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Peer-to-peer file-sharing systems have hundreds of thousands of users sharing petabytes of data, however, their search functionality is limited. In general, query results contain many references to the same data object. These references are grouped, and the size of the group 驴 the number of references it contains 驴 is the typical ranking metric. Although group size is effective in finding popular data, it works poorly for rare, less popular data. Other ranking functions, such as precision and cosine similarity, are more appropriate in this case. We show the significant performance benefitin finding rare data using these ranking functions through extensive simulation.