loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
Content-Based Clustered P2P Search Model Depending on Set Distance
Hong Kong, China
December 18-December 22
ISBN: 0-7695-2749-3
ASCII Text
x 
 
Jing Wang, Shoubao Yang, "Content-Based Clustered P2P Search Model Depending on Set Distance," Web Intelligence and Intelligent Agent Technology, International Conference on, pp. 471-476, 2006 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops, 2006.
 
 
BibTex
x
 
@article{ 10.1109/WI-IATW.2006.53,
author = {Jing Wang and Shoubao Yang},
title = {Content-Based Clustered P2P Search Model Depending on Set Distance},
journal ={Web Intelligence and Intelligent Agent Technology, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2749-3},
pages = {471-476},
doi = {http://doi.ieeecomputersociety.org/10.1109/WI-IATW.2006.53},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Web Intelligence and Intelligent Agent Technology, International Conference on
TI - Content-Based Clustered P2P Search Model Depending on Set Distance
SN - 0-7695-2749-3
SP471
EP476
A1 - Jing Wang,
A1 - Shoubao Yang,
PY - 2006
KW - Peer-to-Peer
KW - Gnutella
KW - Distributed Hash Tables
KW - Set Distance
KW - Vector Space Model
VL - 0
JA - Web Intelligence and Intelligent Agent Technology, International Conference on
ER -
 
Jing Wang, University of Science and Technology of China, China
Shoubao Yang, University of Science and Technology of China, China
The main issues that affect query efficiency and search cost in content-based unstructured P2P search system are the complexity of computing the similarity of the documents brought by high dimensions and the great deal of redundant messages coming with flooding. This paper defines the documents similarity by the way of set distance. This method restrains the complexity of computing the document similarity in linear time. Also, this paper clusters the peers based on content by their set distance to reduce the query time and redundant messages. Simulations show that the content-based search model constructed by set distance not only has higher recall, but also reduce the search cost and query time to the rate of 40% and 30% of Gnutella.
Index Terms:
Peer-to-Peer, Gnutella, Distributed Hash Tables, Set Distance, Vector Space Model
Citation:
Jing Wang, Shoubao Yang, "Content-Based Clustered P2P Search Model Depending on Set Distance," wi-iatw, pp.471-476, 2006 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops, 2006
Usage of this product signifies your acceptance of the Terms of Use.