1) K-th number query
第K大数查询
2) k-NN search
k-NN查询
3) Top-K query
Top-K查询
1.
A feedback-based Top-K query processing algorithm in wireless sensor networks
基于反馈的无线传感器网络Top-K查询处理算法
2.
However, Processing top-k query in pure P2P network is very challenging because a P2P system is a dynamic and decentralized system.
可是,由于P2P系统是一个动态的、分散的系统,在纯的P2P环境下进行top-k查询是具有挑战性的。
3.
In this paper we studied three popular uncertain quries: the Max query, the Top-k query and the kNN query.
本文对三种在分布式系统应用中常见的不确定聚集查询:不确定最大(小)值查询、不确定Top-k查询和不确定kNN查询进行了研究,给出了三种聚集查询的形式化定义,分别提出了以减小分布式聚集查询通信开销为目标的过滤策略,并分别设计了支持这三种查询的数据存储和基于过滤策略的分布式聚集算法。
4) k-NN query
k邻近查询
1.
k-NN query based on multi-autonomous spatial data source is widely used in spatial information realm.
多自治空间数据源的k邻近查询处理在空间信息领域具有广泛的应用。
5) K-nearest neighbor query
k近邻查询
1.
Proposed in this paper is a novel k-nearest neighbor query algorithm based on data grid,called the GkNN.
提出一种在网格环境下的k近邻查询方法——GkNN。
6) CKNN queries
连续k近邻查询
1.
In order to process CKNN queries on the basis of TPR-tree efficiently,a new spatio-temporal distance metrics minmaxdist(t) was presented as a pruning upper bound.
针对基于TPR树索引的连续k近邻查询,引入了一种新的时空距离度量最小最大距离函数作为TPR树索引搜索时节点剪枝上界。
2.
By introducing directional network distance measurement we proposed the directional network expansion(DNE) algorithm to reduce the network searching cost of CKNN queries processing.
基于道路网络的连续k近邻查询是移动对象数据库领域的研究重点和热点。
补充资料：查询权和监督、质询权
查询权和监督、质询权：股东有权查阅公司章程、股东大会会议记录和财务会议报告对公司的经营提出建议或者质询。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条