The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jan. 03, 2012
Filed:
Jan. 30, 2009
Hideki Hayashi, Kodaira, JP;
Daisuke Ito, Fuchu, JP;
Masaaki Tanizaki, Nishitokyo, JP;
Kouji Kimura, Fujisawa, JP;
Hisanori Kajiyama, Yokohama, JP;
Hideki Hayashi, Kodaira, JP;
Daisuke Ito, Fuchu, JP;
Masaaki Tanizaki, Nishitokyo, JP;
Kouji Kimura, Fujisawa, JP;
Hisanori Kajiyama, Yokohama, JP;
Hitachi, Ltd., Tokyo, JP;
Hitachi Solutions, Ltd., Tokyo, JP;
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.