| 道路网络中的连续最近邻查询 |
| |
| 引用本文： | 冯惠妍,郭俊凤.道路网络中的连续最近邻查询[J].计算机工程,2010,36(8):79-82. |
| |
| 作者姓名： | 冯惠妍 郭俊凤 |
| |
| 作者单位： | 1. 黑龙江八一农垦大学信息技术学院,大庆,163319
2. 黑龙江东方学院计算机科学与电气工程学部,哈尔滨,150086 |
| |
| 基金项目： | 黑龙江省教育厅基金资助项目“分布式数据挖掘技术在教学质量评价中的应用”(11533049) |
| |
| 摘 要： | 为了减少连续最近邻查询中计算K个最近邻的次数和减小算法需要的存储空间，提出一种道路网络中求连续最近邻的方法。给出分点的计算方法及连续最近邻查询算法，对算法的正确性、可终止性进行证明，并分析算法复杂度。与相关算法进行实验比较，得出该算法更适合于对象频繁发生变化的实际网络。
|
| 关 键 词： | 道路网络 连续最近邻 分点 查询算法 |
| 修稿时间： | |
Continuous Nearest Neighbor Queries in Road Network |
| |
| FENG Hui-yan,GUO Jun-feng.Continuous Nearest Neighbor Queries in Road Network[J].Computer Engineering,2010,36(8):79-82. |
| |
| Authors: | FENG Hui-yan GUO Jun-feng |
| |
| Affiliation: | (1. College of Information Technology, Heilongjiang Bayi Agricultural University, Daqing 163319; 2. Computer Science and Electrical Equipment Engineering Headquarter, Heilongjiang East University, Harbin 150086) |
| |
| Abstract: | 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. |
| |
| Keywords: | road network Continuous Nearest Neighbor(CNN) split points query algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
