A Novel Approach for the Continuous Search of the K Nearest Neighbors on Road Networks

Searching the K nearest neighbors (KNNs) in road networks is a major problem like in mobile objects warehouses which describe highly dynamic environments. Current approaches to processing this kind of queries in dynamic environments do not provide appropriate results and do not take into account different search constraints such as the road context and disturbance factors as well as the dynamicity of users. This work presents a new model for the continuous search, in a highly dynamic environment, of the KNNs in a road network.