range-query

常見(jiàn)例句

• 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.
  實(shí)驗(yàn)結(jié)果表明,基于分布式范圍樹(shù)的范圍查詢(xún)(DRT-RQ)比基于前綴哈希樹(shù)的范圍查詢(xún)(PHT-RQ)需要更短的查詢(xún)延時(shí)。
• 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ū)域查詢(xún)的代價(jià)和數(shù)據(jù)更新代價(jià)均為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.
  實(shí)驗(yàn)數(shù)據(jù)表明開(kāi)放模型策略(OSS)在性能上超越從前的變換查詢(xún)策略(RQS);比RQS更適合對(duì)大的數(shù)據(jù)集合進(jìn)行處理.
• 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架構(gòu)的不足，能夠很好的支持多維范圍查詢(xún)。
• Fast Range Query in Large High-dimensional Spaces
  大規(guī)模高維向量空間的快速范圍查詢(xún)
• Range queries for querying the current and future positions of the moving objects are becoming increasingly necessary.
  藉由這些配備，查詢(xún)移動(dòng)物體的位置成為目前最為重要的課題。
返回 range-query