Continuous kNN Queries in Dynamic Road Networks

Continuous kNN queries have been widely studied in recent years. Most of the existing methods assume that road network is static; however real-time changes of traffic conditions in road network are always happened. The existing solutions don’t solve continuous KNN queries in dynamic road networks. This paper studies the problem of continuous KNN queries in dynamic road networks, traffic conditions of road segments change on different time, weights of road segments change dynamically. We propose a query algorithm on continue k nearest neighbors in dynamic road networks, the CkNNDN algorithm. The algorithm is applied to query continuous k nearest neighbors in dynamic condition, minimize the count of nearest neighbors candidates, and reduce expensive costs of the shortest path computation. In our tests, the algorithm shows good Effectiveness and efficiency.