Continuous Nearest Neighbor Queries in Road Network
Junfeng Guo · Jisuanji gongcheng · 2010
In order to reduce the number of computing K nearest neighbors and compress the store space in Continuous Nearest Neighbor(CNN) query,a method of computing CNN query in road network is proposed.It presents the method of computing split points and the algorithm of CNN,and provides the proof of the correction and termination and complexity of the CNN query algorithm.By comparing with related algorithms,it concludes that it is more suitable for practical networks with the frequent change of objects in networks.