摘要
基于分布式哈希表(DHT)的结构化P2P网络具有扩展性好、健壮和自组织等优点,但只支持精确匹配的查询。本文提出一种基于分布式范围树的结构化P2P范围查询方法(DRT-RQ),该方法将多维索引的分布式范围树分发到已有的结构化DHT覆盖网络中,利用DHT系统提供的数据查找接口,有效实现数据对象的范围查询。实验结果表明,基于分布式范围树的范围查询(DRT-RQ)比基于前缀哈希树的范围查询(PHT-RQ)需要更短的查询延时。
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 muhidimensionality 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.
出处
《计算机科学》
CSCD
北大核心
2007年第8期69-71,119,共4页
Computer Science
基金
深圳大学科研启动基金(200648)资助
关键词
分布式范围树
分布式哈希表
结构化P2P网络
范围查询
Distributed range tree,Distributed hash table,Structured peer-to-peer networks,Range query
