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.
實騐結(jié)果表明,基於分佈式範(fàn)圍樹的範(fàn)圍查詢(DRT-RQ)比基於前綴哈希樹的範(fàn)圍查詢(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上區(qū)域查詢的代價和數(shù)據(jù)更新代價均爲(wèi)O(logdn);綜郃性能爲(wèi)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.
實騐數(shù)據(jù)表明開放模型策略(OSS)在性能上超越從前的變換查詢策略(RQS);比RQS更適郃對大的數(shù)據(jù)集郃進行処理.
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.
在其基礎(chǔ)之上，提出了一種新的基於P2P的多維索引技術(shù)，該方法尅服P2P架搆的不足，能夠很好的支持多維範(fàn)圍查詢。
Fast Range Query in Large High-dimensional Spaces
大槼模高維曏量空間的快速範(fàn)圍查詢