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.

• 实验结果表明,基于分布式范围树的范围查询(DRT-RQ)比基于前缀哈希树的范围查询(PHT-RQ)需要更短的查询延时。