Finding Rare Data Objects in P2P File-Sharing Systems

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 benefit in finding rare data using these ranking functions through extensive simulation.

• Type: Conference
• Year: 2005
• Where: P2P
• Authors: Wai Gen Yee, Dongmei Jia, Ophir Frieder
• Keywords: P2P 2005, Peer-to-Peer Computing, Popular Data, Ranking Functions, Users Sharing Petabytes