1) neighbor node search
邻居结点查询
2) group nearest neighbor query
组最近邻居查询
1.
As the group nearest neighbor query has its own feature,three query optimization methods are offered,which include the improved k+1 group nearest neighbor query algorithm,the ellipse-based pruning method and the delayed update method.
基于移动对象增量最近邻居查询(INCNN),提出一种移动对象增量组最近邻居查询方法(INCGNN)。
3) nearest neighbor query
最近邻居查询
1.
As the group nearest neighbor query has its own feature,three query optimization methods are offered,which include the improved k+1 group nearest neighbor query algorithm,the ellipse-based pruning method and the delayed update method.
基于移动对象增量最近邻居查询(INCNN),提出一种移动对象增量组最近邻居查询方法(INCGNN)。
4) k nearest neighbour query
k最近邻居查询
5) constraint ANN query
受限k最近邻居查询
6) nearest neighbor query
近邻查询
1.
According to the abstract degree, nearest neighbor query has three main categories: nearest neighbor query between point and point, nearest neighbor query between point and line segment, and nearest neighbor query between line segment and line segment.
空间数据库的近邻查询近几年受到人们越来越多的关注。
2.
In this paper we proposed a new method,dimensionality reduction with DCT,and further provided the method of similarity search about range query and nearest neighbor query.
提出了一种新的方法,利用离散余弦变换(DCT)进行维归约,并在此基础上给出了对时序数据进行范围查询和近邻查询的相似性搜索方法。
补充资料：点接触结（pointcontactjunction）
点接触结（pointcontactjunction）
简便的方式是将超导体一削尖的端点（约0.1μm端径）施压在另一超导体小面上而接触成点接触结，它是一种弱连接。由于压力可调节，就可选择最好所需最适宜接触性能。点接触结可用于制作磁强计和微波接收与发射等装置。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条