A METHOD FOR COMPUTING SAFE EXIT POINTS OF MOVING K-NEAREST NEIGHBOR QUERIES IN ROAD NETWORKS

摘要

The present invention relates to a method of computing moving k-nearest neighbor queries and results and a safe exit location in a road network and, more specifically, to a method and apparatus for providing k-nearest neighbor queries and results, a safe area, and a safe exit altogether by receiving the request of a client terminal. The present invention provides the safe area providing queries process, queries and results, and same k-nearest neighbor queries and results from a server in order to improve a method of minimizing the communication of the server and the client terminal when the client terminal is disposed within the safe area. According to the present technology, the method can reduce the computational cost of the server and reduce the cost of communication between the client and the server.