-
1.发明授权K-nearest neighbor search method, k-nearest neighbor search program, and k-nearest neighbor search device 有权K最近邻搜索方法，k-最近邻搜索程序和k-最近邻搜索装置公开(公告)号：US08090745B2
公开(公告)日：2012-01-03
申请号：US12362962
申请日：2009-01-30
Applicant: Hideki Hayashi , Daisuke Ito , Masaaki Tanizaki , Kouji Kimura , Hisanori Kajiyama
Inventor： Hideki Hayashi , Daisuke Ito , Masaaki Tanizaki , Kouji Kimura , Hisanori Kajiyama
IPC: G06F17/30
CPC classification number: G06F17/30241 , G06F17/30539 , G06K9/6276
Abstract: 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.
Abstract translation: 提供一种搜索DBMS中用于从多维点创建空间索引的任意点的最近点的查询数k的k最近邻搜索方法，包括设置搜索条件，判断哪个最低分支和中间 所述空间索引的与所述查询点最近的区域的分支是：当最近区域被判断为最低分支时，计算最近区域的查询点与子区域之间的距离，存储分割区域的信息 已经成为计算对象，当最近区域被判定为中间区域时，计算查询点与包含在最近区域中的点之间的距离，存储已经成为计算对象的点的信息，整理搜索处理 当满足搜索条件时，并从DBMS获取搜索结果。
-
2.发明申请K-NEAREST NEIGHBOR SEARCH METHOD, K-NEAREST NEIGHBOR SEARCH PROGRAM, AND K-NEAREST NEIGHBOR SEARCH DEVICE 有权K-NEAREST邻居搜索方法，K-NEAREST邻域搜索程序和K邻近邻域搜索设备公开(公告)号：US20090210413A1
公开(公告)日：2009-08-20
申请号：US12362962
申请日：2009-01-30
Applicant: Hideki HAYASHI , Daisuke Ito , Masaaki Tanizaki , Kouji Kimura , Hisanori Kajiyama
Inventor： Hideki HAYASHI , Daisuke Ito , Masaaki Tanizaki , Kouji Kimura , Hisanori Kajiyama
IPC: G06F17/30
CPC classification number: G06F17/30241 , G06F17/30539 , G06K9/6276
Abstract: 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.
Abstract translation: 提供一种搜索DBMS中用于从多维点创建空间索引的任意点的最近点的查询数k的k最近邻搜索方法，包括设置搜索条件，判断哪个最低分支和中间 所述空间索引的与所述查询点最近的区域的分支是：当最近区域被判断为最低分支时，计算最近区域的查询点与子区域之间的距离，存储分割区域的信息 已经成为计算对象，当最近区域被判定为中间区域时，计算查询点与包含在最近区域中的点之间的距离，存储已经成为计算对象的点的信息，整理搜索处理 当满足搜索条件时，并从DBMS获取搜索结果。
-
Search Results
2
records
(took 0.009 seconds)
