Referenced Items are not available for this document.
Structured peer-to-peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called distributed hash tables (DHTs) is partitioned and each partition with its keys and values is assigned to a node in the DHT. For data retrieval however, the very nature of hash tables allows only exact pattern matches. We propose Cerco, a simple solution for the problem of range queries by employing a hierarchically structured P2P approach based on the principles of distributed hash tables. We show that a dynamic hierarchy of DHTs with on-demand classification of items can positively influence the response time of queries while maintaining lookup correctness
Published in:
Local Computer Networks, Proceedings 2006 31st IEEE Conference on
Date of Conference: 14-16 Nov. 2006
- Page(s):
- 509 - 510
- ISSN :
- 0742-1303
- E-ISBN :
- 1-4244-0419-3
- Print ISBN:
- 1-4244-0418-5
- INSPEC Accession Number:
- 9420304
- Conference Location :
- Tampa, FL
- Digital Object Identifier :
- 10.1109/LCN.2006.322147
- 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.
