首页> 外国专利> K-nearest neighbor search method, k-nearest neighbor search program, and k-nearest neighbor search device

K-nearest neighbor search method, k-nearest neighbor search program, and k-nearest neighbor search device

机译:K近邻搜索方法,K近邻搜索程序和K近邻搜索设备

摘要

Provided is a k-nearest neighbor search method of searching for a query number k of nearest points to an arbitrary point in a DBMS for creating a spatial index from multidimensional points, comprising setting a search conditions, judging which of a lowest branch and an intermediate branch of the spatial index a nearest region to the query point is, calculating, when the nearest region is judged to be the lowest branch, a distance between the query point and a child region of the nearest region, storing information of a divided region which has become a calculation target, calculating, when the nearest region is judged to be the intermediate region, a distance between the query point and a point included in the nearest region, storing information of the point which has become a calculation target, finishing search processing when the search conditions are satisfied, and obtaining a search result from the DBMS.
机译:提供一种k近邻搜索方法,该方法搜索在DBMS中到任意点的最近点的查询数k以从多维点创建空间索引,该方法包括设置搜索条件,判断最低分支和中间分支中的哪一个。空间索引的最接近查询点的区域的分支,当判断最接近的区域为最低分支时,计算查询点与最接近区域的子区域之间的距离,并存储划分区域的信息,其中已成为计算目标,当判断最近的区域为中间区域时,计算查询点与最近区域中包括的点之间的距离,存储已成为计算目标的点的信息,结束搜索处理当满足搜索条件时,从DBMS获取搜索结果。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号