Velocity-Dependent Nearest Neighbor Query

Location-based services recommend points of interests (POIs) which are nearer to the user’s position q. In practice, when the user is moving with a velocity \(\overrightarrow{v}\), he may prefer the nearer POIs which match his moving direction. In this paper, we propose the velocity-dependent nearest neighbor query (VeloNN query), which selects the POIs that are nearer and best match the user’s moving direction. In the VeloNN query, if the direction of a POI o highly matches the direction of \(\overrightarrow{v}\), o is likely to be preferred. Since computing the directional preferences of all POIs is time-consuming, we propose rules to filter out the POIs with low directional preferences. We also divide the space into tiles, i.e., rectangular areas, and compute a candidate set for each tile in advance. The VeloNN candidates can be quickly prepared after finding the tile where the user is. We conduct experiments on both synthetic and real datasets and the results show the proposed algorithms can support VeloNN queries efficiently.