Continuous Nearest Neighbor Queries in Weight Changing Road Networks

Abstract

Recent researches have focused on continuous nearest neighbor queries in road networks with fixed weight, where all the users find the same routes to the nearest neighbors all the time. As more and more people follow the same way, traffic jams occur and users have to spend more time to get the destinations. In this paper, we propose a novel form of continuous k nearest neighbor queries considering the large scale weight changes in road networks. By using real-time traffic information as the changing weight, we present a Domination Relationship Monitoring Algorithm to solve Continuous k Nearest Neighbor queries in weight changing road networks, which can find the fastest way to k nearest neighbors according to the traffic conditions and avoid traffic jams. Moreover, our algorithm achieves the target of Continuous obstructed Nearest Neighbor to some extent. A comprehensive experimental evaluation using real data has been conducted to demonstrate the efficiency and effectiveness of our algorithm.