期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

空间数据库中连续可视反向最近邻查询 被引量：4

Continuous Visible Reverse Nearest Neighbor Queries in Spatial Databases
在线阅读 下载PDF
导出
摘要 为了解决障碍物环境中连续反向最近邻的查询问题,考虑到障碍物的存在,将可视性加到连续反向最近邻查询中,提出了一种新的连续反向最近邻查询的变体——连续可视反向最近邻查询.给出了线段可视性判断方法和相应的剪枝策略,提出了连续可视反向最近邻查询算法.该算法通过过滤步骤得到一个候选集,通过精炼步骤去掉错误的候选,通过分裂步骤找到查询结果.实验结果表明,该算法的执行时间与查询线段的长度呈线性关系增长,查询效率较高. In order to solve the problem of CRNN （continuous reverse nearest neighbor） query in an obstacle environment, the visibility was added to the CRNN query by taking obstacles into consideration, and a novel variant of CRNN queries, namely continuous visible reverse nearest neighbor （CVRNN） search, was introduced. The segment visibility judgment method and the corresponding pruning strategy were given. A CVRNN query processing algorithm was proposed. With this algorithm, a candidate set is gotten through a filter step, the wrong candidates were removed by a refinement step, and query results are founded through a splitting step. Experimental results show that the algorithm execution time increases linearly with the length of query line segment, and the proposed algorithm has a high query efficiency.
作者 杨泽雪 郝忠孝
机构地区 哈尔滨理工大学计算机科学与技术学院 黑龙江工程学院计算机科学与技术系 哈尔滨工业大学计算机科学与技术学院
出处 《西南交通大学学报》 EI CSCD 北大核心 2012年第3期451-457,共7页 Journal of Southwest Jiaotong University
基金 国家自然科学基金资助项目(60673136) 黑龙江省自然科学基金资助项目(F200601)
关键词 障碍 空间查询 空间数据库 可视性 obstruct spatial query spatial database visibility
分类号 TP311.131 [自动化与计算机技术—计算机软件与理论]
作者简介 作者简介：杨泽雪（1978-），女，讲师，博士研究生，研究方向为空间数据库查询，电话：13091434533，E-mail：yzx1978@126．com. 郝忠孝（1940-），男，教授，博士生导师，研究方向为空值环境下数据库理论、无环数据库、主动数据库、时态数据库和空间数据库理论及应用等．
  • 相关文献

参考文献17

  • 1FLIP K, MUTHUKRISHNAN S. Influence sets based on reverse nearest neighbor queries//Proc. of the 2000 ACM SIGMOD International Conference on Management of Data. Dallas: Association for Computing Machinery, 2000: 201-212.
  • 2YANG C, LINK I. An index structure for efficient reverse nearest neighbor queries//Proc. of the IEEE International Conference on Data Engineering. Heidelberg:Institute of Electrical and Electronics Engineers Computer Society, 2001: 485-492.
  • 3STANOI I, AGRAWAL D, ABBADI A. Reverse nearest neighbor queries for dynamic databases//ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. Dallas: Association for Computing Machinery, 2000: 44-53.
  • 4TAO Y, PAPADIAS D, LIAN X. Reverse kNN search in arbitrary dimensionality//Proc. of the 30th Very Large Data Bases Conference.Toronto:VLDB Endowment, 2004: 744-755.
  • 5SINGH A, FERHATOSMANOGLU H, TOSUN A. High dimensional reverse nearest neighbor queries//Proc. of ACM CIKM International Conference on Information and Knowledge Management. New Orleans: Association for Computing Machinery, 2003: 91-98.
  • 6TAO Y, YIU M L, MAMOULIS N. Reverse nearest neighbor search in metric spaces[J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(9): 1239-1252.
  • 7BENETIS R, JENSEN C S, KARCIAUSKAS G, et al. Nearest and reverse nearest neighbor queries for moving objects[J]. The VLDB Journal, 2006, 15(3): 229-249.
  • 8KANG J M, MOKBEL M F, SHEKHAR S, et al. Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors//Proc. of International Conference on Data Engineering. Istanbul: IEEE, 2007: 806-815.
  • 9XIA T, ZHANG D. Continuous reverse nearest neighbor monitoring//Proc. of International Conference on Data Engineering.Atlanta:Institute of Electrical and Electronics Engineers Computer Society, 2006: 77-86.
  • 10TAO Y, PAPADIAS D, LIAN X, et al. Multi-dimensional reverse kNN search[J]. The VLDB Journal, 2007, 16(3): 293-316.

二级参考文献11

  • 1Netanong S, Tanin E, Zhang R. Visible nearest neighbor queries//Proceedings of the Database Systems for Advanced Applications. Bangkok, 2007:876- 883.
  • 2Nutanong S, Tanin E, Zhang R. Incremental evaluation of visible nearest neighbor queries. IEEE Transactions on Knowledge and Data Engineering (TKDE), 2010, 22 (5) 665-681.
  • 3Gao Y J, Zheng B H, Lee W C, Chen G C. Continuous visible nearest neighbor queries//Proeeedings of the Internation al Conference on Extending Database Technology. Saint Petersburg, 2009:144-155.
  • 4Cheng R, Kalashnikov D V, Prabhakar S. Querying imprecise data in moving object environments. IEEE Transactions on Knowledge and Data Engineering(TKDE), 2004, 16(9): 1112-1127.
  • 5Kriegel H P, Kunath P, Renz M. Probabilistic nearest neighbor query on uncertain objects//Proceedings of the Da tabase Systems for Advanced Applications. Bangkok, 2007 337-348.
  • 6Cheng R, Chen J C, Mokbel M F, Chow C Y. Probabilistic verifiers: Evaluating constrained nearest neighbor queries over uncertain data//Proceedings of the International Conference on Data Engineering. Cancfin, 2008 973-982.
  • 7Beskales G, Soliman M A, Ilyas I F. Efficient search for the top k probable nearest neighbors in uncertain databases// Proceedings of the VLDB Endowment. 2008, 1(1) 326-339.
  • 8Tao Y F, Xiao X K, Cheng R. Range search on multidimensional uncertain data. ACM Transactions on Database Systems, 2007, 32(3)15.
  • 9Zhang Y, Lin X M, Zhu G P, Zhang W J, Lin Q L Efficient rank based KNN query processing over uncertain data//Pro ceedings of the International Conference on Data Engineering. California, 2010:28-39.
  • 10Asano T, Cuibas L J, Hershberger J, Imai H. Visibility polygon search and euclidean shortest paths//Proceedings of the Annual Symposium Foundations of Computer Science. Portland, 1985, 155-164.

共引文献10

同被引文献30

  • 1常明,郝忠孝.时空数据库中反向最近邻查询的方法研究[J].齐齐哈尔大学学报（自然科学版）,2005,21(2):54-56. 被引量：2
  • 2CHEN Y, PATEL J M. Efficient Evaluation of all-nearest-neigh- bor Queries[ C]//Proc of the 23rd International Conference on Data Engineering, ICDE, Istanbul, Turkey, 2007:1056-1065.
  • 3SHARIFZADEH M, KOLAHDOUZAN M, SHAHABI C. The Op- timal Sequenced Route Query[J]. The VLDB Journal, 2008, 17 (4) : 765 -787.
  • 4DENG K, ZHOU X, SHEN H T, et al. A Multi-resolution Surface Distance Model for k-NN Query Processing [ J ]. The VLDB Jour- nal, 2008(17) : 1101 -1119.
  • 5ZHANG J, PAPADIAS D, MOURATIDIS K, et al. Query Proeessing in Spatial Databases Containing Obstacles[ J]. Inter- national Journal of Geogrophical Information Science, 2005, 19 (10): 1091-1111.
  • 6GAO Y, ZHENG B. Continuous Obstructed Nearest Neighbor Queries in Spatial Databases[ C ]//Proc of the ACM SIGMOD In- ternational Conference on Management of Data, Providence, Rhode Island, USA, 2009 : 577 - 589.
  • 7NUTANONG S, TANIN E, ZHANG R. Visible Nearest Neighbor Queries[ C ]//Proc of the 12th Intemational Conference on Database Systems for Advanced Applications, Bangkok, 2007:876 -883.
  • 8NUTANONG S, TANIN E, ZHANG R. Incremental Evaluation of Visible Nearest Neighbor Queries [ J ]. IEEE Transactions on Knowledge and Data Engineering, 2010, 22 (5) : 665 - 681.
  • 9GAO Y, ZHENG B, LEE W C, et al. Continuous Visible Nea- rest Neighbor Queries [ C ]//Proc of the 12th International Confer- ence on Extending Database Technology, Saint Petersburg, 2009 : 144 - 155.
  • 10LIAN X, MEMBER S, CHEN L. Probabilistic Group Nearest Neighbor Queries in Uncertain Databases[ J-. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(6): 809- 824.

引证文献4

二级引证文献6

西南交通大学学报
2012年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
关于我们 | 版权声明 | 联系我们 | 帮助中心| 意见反馈
主办单位：上海市教育委员会
技术支持：重庆维普资讯有限公司
渝公网安备 50019002500403号
使用帮助 返回顶部