Cerco: Supporting Range Queries with a Hierarchically Structured Peer-to-Peer System
Abstract
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.
Type
Publication
Proceedings of 31st IEEE Conference on Local Computer Networks (LCN 2006)
Klaus Wehrle
Head of Group
Leo Petrak