Referenced Items are not available for this document.
This paper proposed a structured p2p model called balance-peer, introduce a method to partition the data rang without any global information on the load to. Our Balance-peer model is used to realize a partition-by-keyword indexing service based on DHT with each node in the system responsible for part of the keywords of the inverted index list. In this paper we use the concept of data partition in parallel databases to realize the load balance in P2P systems. At last this paper has the performance test. The result convinces us that our storage balance strategy is valid.
Published in:
Computer Engineering and Technology (ICCET), 2010 2nd International Conference on
(Volume:3
)
Date of Conference: 16-18 April 2010
- Page(s):
- V3-236 - V3-239
- Print ISBN:
- 978-1-4244-6347-3
- INSPEC Accession Number:
- 11522418
- Conference Location :
- Chengdu
- Digital Object Identifier :
- 10.1109/ICCET.2010.5485850
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
