Invention Grant
US08090745B2 K-nearest neighbor search method, k-nearest neighbor search program, and k-nearest neighbor search device
有权
K最近邻搜索方法,k-最近邻搜索程序和k-最近邻搜索装置
- Patent Title: K-nearest neighbor search method, k-nearest neighbor search program, and k-nearest neighbor search device
- Patent Title (中): K最近邻搜索方法,k-最近邻搜索程序和k-最近邻搜索装置
-
Application No.: US12362962Application Date: 2009-01-30
-
Publication No.: US08090745B2Publication Date: 2012-01-03
- Inventor: Hideki Hayashi , Daisuke Ito , Masaaki Tanizaki , Kouji Kimura , Hisanori Kajiyama
- Applicant: Hideki Hayashi , Daisuke Ito , Masaaki Tanizaki , Kouji Kimura , Hisanori Kajiyama
- Applicant Address: JP Tokyo JP Tokyo
- Assignee: Hitachi, Ltd.,Hitachi Solutions, Ltd.
- Current Assignee: Hitachi, Ltd.,Hitachi Solutions, Ltd.
- Current Assignee Address: JP Tokyo JP Tokyo
- Agency: Brundidge & Stanger, P.C.
- Priority: JP2008-037362 20080219
- Main IPC: G06F17/30
- IPC: G06F17/30

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.
Public/Granted literature
Information query