Cart (Loading....) | Create Account
Close category search window
 

Answering Continuous Rank Join Query in P2P 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
$31 $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

5 Author(s)
Kejun Zhao ; Network & Inf. Center, Shandong Univ., Jinan, China ; Xinjun Wang ; Yang Liu ; Qi Liu
more authors

Peer-to-peer (P2P) networks are achieved more and more attention, compared with C/S service mode, P2P is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous rank join query in P2P networks. In the algorithm proposed, the data that cannot contribute the final ranked results will be discarded directly based on pre-computing the minimum values of rank function's attributes. Experiments show that the algorithm ensures the availability of rank query and network traffic is reduced up to 90% as well as.

Published in:

Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on

Date of Conference:

18-20 Jan. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.