loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'04)
Probabilistic file indexing and searching in unstructured peer-to-peer networks
Chicago, IL, USA
April 19-April 22
ISBN: 0-7803-8430-X
An-Hsun Cheng, Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei, Taiwan
Yuh-Jzer Joung, Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei, Taiwan
We propose a simple, practical, yet powerful index scheme to enhance search in unstructured P2P networks. The index scheme uses a data structure "Bloom Filters" to index files shared at each node, and then let nodes gossip to one another to exchange their Bloom filters. In effect, each node indexes a random set of files in the network, thereby allowing every query to have a constant probability to be successfully resolved within a fixed search space. The experimental results show that our approach can improve the search in Gnutella by an order of magnitude.
Citation:
An-Hsun Cheng, Yuh-Jzer Joung, "Probabilistic file indexing and searching in unstructured peer-to-peer networks," ccgrid, pp.9-18, Fourth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.