By Topic

Query Based Clustering Method in Structured P2P Overlay Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qing Ma ; Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China ; Kun Zhao ; Xiaoxiang Wang

In structured peer-to-peer (P2P) overlay networks, similar documents are randomly distributed over peers with their data identifiers consistently hashed, which makes complex search challenging. Current state-of-the-art complex query approaches in structured P2P systems are mainly based on inverted list intersection. When the identifiers are distributed among peers, a complex query may involve many peers and cause a large amount of network traffic. One solution of implementing efficient complex query is to organize documents on each peer using clustering. In this paper, we propose a clustering method, QBC, which is composed of pull mode and push mode. Pull mode uses historical queries to direct clustering in structured P2P overlay networks and push mode applies modified vector space model (VSM) to define document set on each peer in order to assist clustering. Experiments show that QBC can reduce the number of peers visited during complex search, hence both query response time and network traffic are decreased.

Published in:

2010 7th IEEE Consumer Communications and Networking Conference

Date of Conference:

9-12 Jan. 2010