采用网络分区与预计算策略的k近邻查询算法K-nearest neighbors queries using network partitions and precomputation
肖晖,盛庆红,黄旭,王彦革
摘要(Abstract)：
k近邻查询是GIS和空间数据库等领域的研究热点。文章针对道路网络中的k近邻查询,通过分区以及预计算近邻集策略,获得查询点的k近邻结果:首先利用自适应格网分区方法将道路网络划分为若干格网单元,并存储格网内节点与边界点、边界点之间距离;其次在网络中的节点预先存储近邻集。实验证明,在兴趣点密度高、k值较大情况下,算法具有较好的性能。
关键词(KeyWords)： 道路网;k近邻查询;预计算;网络分区;GIS
基金项目(Foundation): 国家自然科学基金项目(41301512,41101441);; 安徽大学博士科研启动经费项目
作者(Author): 肖晖,盛庆红,黄旭,王彦革
DOI: 10.16251/j.cnki.1009-2307.2014.12.024
参考文献(References)：
- [1]Papadias D,et al.Query Processing in Spatial Network Databases[C]//Proceedings of the 29th International Conference on Very Large Data Bases.Berlin,Germany,2003:802-813.
- [2]Kolahdouzan M C Shahabi.Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases[C]//Proceedings of the 30th International Conference on Very Large Data Bases.Toronto,Canada,2004:765-777.
- [3]Huang X C,S Jensen,S Saltenis.The Islands Approach to Nearest Neighbor Querying in Spatial Networks[C]//Proceedings of the 9th International Symposium on Advances in Spatial and Temporal Databases.Berlin,Germany,2005:73-90.
- [4]肖晖,杨必胜.一种改进的基于道路网络距离的K近邻查询算法[J].武汉大学学报·信息科学版,2008,33(4):437-439.
- [5]Demiryurek U,F Banaei-Kashani C Shahabi.Efficient k-nearest Neighbor Search in Time-dependent Spatial Networks[C]//Proceedings of the 21st International Conference on Database and Expert Systems Applications.Bilbao,Spain,2011:432-449.
- [6]Geng Zhao,Kefeng Xuan,et al.Voronoi-Based Continuous k Nearest Neighbor Search in Mobile Navigation[C]//IEEE Transactions on Industrial Electronics,2012,58(6):2247-2257.
- [8]廖浩均,韩冀中,方金云.空间数据库中全局最近邻查询处理方法[J].计算机研究与发展,2011,48(1):86-93.
- [8]Benetis R,et al.Nearest and Reverse Nearest Neighbor Queries for Moving Objects[C]//Proceedings of the 32nd International Journal on Very Large Data Bases.Seoul,Korea,2006,15(3):229-249.