k-NEAREST NEIGHBOR SEARCH METHOD AND k-NEAREST NEIGHBOR SEARCH PROGRAM AND k-NEAREST NEIGHBOR SEARCH DEVICE

摘要

PPROBLEM TO BE SOLVED: To suppress memory usage in search processing while shortening the retrieval time of a space database. PSOLUTION: Provided is a k-nearest neighbor search method of searching for the high order k of nearest point data to an arbitrary point in a DBMS for creating a spatial index from multidimensional point data, comprising steps for setting a query point and the number of items of query to search conditions, determining which of a lowest branch and an intermediate branch of the spatial index a nearest region to the query point is, calculating a distance between the query point and the child region of the nearest region when the nearest region is determined to be the lowest branch from the determination of the lowest branch, storing the information of a divided region which has become the calculation target of region distance calculation, obtaining the nearest region, calculating a distance between the query point and point data included in the nearest region when the nearest region is determined to be the intermediate branch from the determination of the lowest branch, storing the point data which have become the calculation target of the distance calculation, finishing search processing when the search conditions are satisfied, and obtaining the records of the stored point data as a search result from the DBMS. PCOPYRIGHT: (C)2009,JPO&INPIT