摘要
为了减少连续最近邻查询中计算K个最近邻的次数和减小算法需要的存储空间,提出一种道路网络中求连续最近邻的方法。给出分点的计算方法及连续最近邻查询算法,对算法的正确性、可终止性进行证明,并分析算法复杂度。与相关算法进行实验比较,得出该算法更适合于对象频繁发生变化的实际网络。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第8期79-82,共4页
Computer Engineering
基金
黑龙江省教育厅基金资助项目"分布式数据挖掘技术在教学质量评价中的应用"(11533049)
关键词
道路网络
连续最近邻
分点
查询算法
road network
Continuous Nearest Neighbor（CNN）
split points
query algorithm
