计算机科学 ›› 2014, Vol. 41 ›› Issue (6): 136-141.doi: 10.11896/j.issn.1002-137X.2014.06.027

• 软件与数据库技术 • 上一篇    下一篇

动态受限区域内的单纯型连续近邻链查询方法

李松,张丽平,朱德龙,郝晓红   

  1. 哈尔滨理工大学计算机科学与技术学院 哈尔滨150080;哈尔滨理工大学计算机科学与技术学院 哈尔滨150080;哈尔滨理工大学计算机科学与技术学院 哈尔滨150080;哈尔滨理工大学计算中心 哈尔滨150080
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受黑龙江省教育厅科学技术研究项目(12531120)资助

Simple Continues Near Neighbor Chain Query in Dynamic Constrained Regions

LI Song,ZHANG Li-ping,ZHU De-long and HAO Xiao-hong   

  • Online:2018-11-14 Published:2018-11-14

摘要: 受限区域内的单纯型连续近邻链查询在空间数据挖掘、数据的相似分析和推理、空间数据库等方面具有重要的作用。为了弥补已有方法的不足,详细研究了动态受限区域内的单纯型连续近邻链查询方法。基于计算几何中的Voronoi图给出了VOR_IN_CRSCNNC算法、VOR_EX_CRSCNNC算法和VOR_DE_CRSCNNC算法。进一步进行了实验比较和分析。理论研究和实验分析表明,所提出的算法在查询过程中减少了数据逐一筛选和判断的冗余计算,在处理空间数据量较大、初始受限区域数据量较多、受限区域形状较为复杂的单纯型连续近邻链查询方面具有较大的优势。

关键词: 空间数据库,Voronoi图,最近邻查询,单纯型连续近邻链,受限区域 中图法分类号TP311文献标识码A

Abstract: The simple continues near neighbor chain query in the constrained regions(CRSCNNC-Query) has important significance in the spatial data mining,similarity analysis and reasoning of data,spatial database etc.To remedy the deficiency of the existing work,the simple continues near neighbor chain query in the dynamic constrained regions was stu-died respectively.The VOR_IN_CRSCNNC algorithm,VOR_EX_CRSCNNC and the VOR_DE_CRSCNNC algorithm were presented based on the Voronoi diagram.Furthermore,the performance of the methods were analyzed and compared by experiment.The theatrical study and the experimental results show that the redundant calculation is reduced and the algorithms hold large advantage at the big data sets and the regions with complex shapes.

Key words: Spatial database,Voronoi diagram,Near neighbor query,Simple continues near neighbor chain,Constrained region

[1] 郝忠孝.时空数据库查询与推理[M].北京:科学出版社,2010
[2] 李松,张丽平,孙冬璞.空间关系查询与分析[M].哈尔滨:哈尔滨工业大学出版社,2011
[3] Mouratidis K,Yiu Man-lung.Dimitris papadias.Continuous nearest neighbor monitoring in road networks[C]∥VLDB. Seoul,Korea,2006
[4] 李艳红,李国徽,杜小坤.路网中双色数据集上连续反向k近邻查询处理的研究[J].计算机科学,2012,9(11):131-136
[5] Nutanong S,Tanin E,Zhang Rui.Incremental evaluation of visible nearest neighbor queries[J].IEEE Transactions on Know-ledge Engineering,2010,2:665-681
[6] Gao Yun-jun,Zheng Bai-hua,Chen Gen-cai,et al.Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases[J].IEEE Trans.Knowl.Data Eng,2009,1:1314-1327
[7] Hu Ling,Jing Yi-nan,Ku Wei-Shinn,et al.Enforcing k Nearest Neighbor Query Integrity on Road Networks[C]∥Proceedings of the 20th International Conference on Advances in Geographic Information Systems.2012:422-425
[8] Elmongui H G,Mokbel M F,Aref W G.Continuous aggregate nearest neighbor queries[J].GeoInformatica,2013,7(1):63-95
[9] 苗东菁,石胜飞,李建中.一种局部相关不确定数据库快照集合上的概率频繁最近邻算法[J].计算机研究与发展,2011,8(10):1812-1822
[10] 袁培森,沙朝锋,王晓玲,等.一种基于学习的高维数据c-近似最近邻查询算法[J].软件学报,2012,3(8):2018-2031
[11] 刘润涛,郝忠孝.空间数据库平面线段快速最近邻查询算法[J].计算机研究与发展,2011,8(12):2379-2384
[12] 李松,郝忠孝.基于Voronoi图的反向最近邻查询方法研究[J].哈尔滨工程大学学报,2008,9(3):261-265
[13] 李松,张丽平,蔡志涛.数据集中单纯型连续近邻链查询方法[J].计算机工程,2012,38(4):82-85
[14] Zhang Li-ping,Li Song,Li Lin,et al.Simple Continues NearNeighbor Chain Query of the Datasets Based on the R Tree[J].Journal of Computaional Information Systems,2012,8(22):9159-916
[15] 张丽平,李林,李松,等.预定数据链规模的单纯型连续近邻链查询[J].计算机工程,2012,8(10):51-53
[16] Sacl J R,Urrutia J.Voronoi diagrams[M]∥Handbook on Computational Geometry.Ottawa:Elsevier Science,2000:201-290
[17] 李松,郝忠孝.基于Vague集的含洞不规则Vague区域关系[J].计算机研究与发展,2009,6(5):823-831

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!