Optical location method based on double-color reverse nearest neighbor query

Abstract

The invention discloses an optical location method based on double-color reverse nearest neighbor query. The double-color reverse nearest neighbor query technology in a spatial database is used, the space quartering method and the Thiessen polygon are used in the optical location method, and it is guaranteed that query results have maximum reverse nearest neighbors so as to enable the minimum distances from the query results to the corresponding reverse nearest neighbors to be maximum. The optical location method includes the steps that firstly, nearest position circle domains of all client points are generated; secondly, the quartering method is used for finding out a rectangular region, and the rectangular region is made to fall in intersection sets of the nearest position circle domains as much as possible; thirdly, two effective pruning rules are used for pruning nearest position circle domain sets related to the rectangular region obtained in the former step; finally, an optical location point is find out according to the pruned nearest position circle domain sets and the Thiessen polygon. According to the optical location method, the searching space for query is greatly reduced, the query efficiency is obvious better than that of an existing method, and the optimal performance is provided.

Description

technical field [0001] The invention relates to a query technology of a spatial database, in particular to an optimal address method based on two-color reverse nearest neighbor query. Background technique [0002] With the continuous development and popularization of wireless communication technology, remote sensing technology and positioning system, a large amount of spatial location data is growing at an unprecedented rate. Query and search based on spatial databases are widely used, and query algorithms on various spatial databases have become a research hotspot. [0003] Typical spatial database queries include nearest neighbor query and reverse nearest neighbor query. A nearest neighbor query returns the point closest to the query point, while an inverse nearest neighbor query returns the set of points that have the query point as its nearest neighbor. The number of points in the set returned by the reverse nearest neighbor query reflects the influence of the query po...

AI Technical Summary

Problems solved by technology

[0005] At present, there are algorithms such as MaxOverlap and MaxFirst for the maximum two-color inverse nearest neighbor query, but these a

Images