Multidimensionality Range Query Based on Distributed Range Tree in Structured Peer-to-Peer Networks
基于分布式范围树的结构化P2P多维范围查询

Distributed Hash Tables are scalable,robust,and self-organizing Peer-to-Peer systems that support exact match lookups.This paper describes the design and implementation of a distributed range tree based multidimensionality range query(DRT-RQ)in structured Peer-to-Peer networks.This method enables more sophisticated queries over a DHT,which distribute the distributed range tree to existing DHT overlay network,and then uses the lookup interface of a DHT to implement the range query efficiently.Compared the query performance with the prefix hash table based range query(PHT-RQ),the experiment results showe that the DRT-RQ consumes less query latency.