1) 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。
2) k-NN query
k邻近查询
1.
k-NN query based on multi-autonomous spatial data source is widely used in spatial information realm.
多自治空间数据源的k邻近查询处理在空间信息领域具有广泛的应用。
3) 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近邻查询是移动对象数据库领域的研究重点和热点。
5) k nearest neighbour query
k最近邻居查询
6) constraint ANN query
受限k最近邻居查询
补充资料：查询权和监督、质询权
查询权和监督、质询权：股东有权查阅公司章程、股东大会会议记录和财务会议报告对公司的经营提出建议或者质询。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条