range-query

基本解释

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)需要更短的查询延时。
Both of the range query and update costs of HDC are O(logdn), and the overall cost is O((logn)2d) (under the CqCu model) or O(K (logn)d) (under the Cqnq+Cunu model).
HDC上区域查询的代价和数据更新代价均为O(logdn);综合性能为O((logn)2d)(使用CqCu模型)或O(K(logn)d)(使用Cqnq+Cunu模型).
The experimental evaluation showed that OSS consistently outperforms classical range query strategies (RQS) and OSS is more scalable than RQS for large data sets.
实验数据表明开放模型策略(OSS)在性能上超越从前的变换查询策略(RQS);比RQS更适合对大的数据集合进行处理.
Furthermore, novel P2P architecture for multi-dimension indexing is proposed which can effectively support multi-dimension range query and makeup the drawback of traditional P2P architecture.
在其基础之上，提出了一种新的基于P2P的多维索引技术，该方法克服P2P架构的不足，能够很好的支持多维范围查询。
Fast Range Query in Large High-dimensional Spaces
大规模高维向量空间的快速范围查询