首页 | 本学科首页   官方微博 | 高级检索  
     

时空数据库中基于TPR-树的反向最近邻查询
引用本文:于海彦,郝忠孝.时空数据库中基于TPR-树的反向最近邻查询[J].哈尔滨理工大学学报,2007,12(3):87-90.
作者姓名:于海彦  郝忠孝
作者单位:哈尔滨理工大学,计算机科学与技术学院,黑龙江,哈尔滨,150080
摘    要:为研究动态环境下解决反向最近邻查询的算法,采用TPR-树索引结构给出了解决动态环境下的最近邻查询算法,并提出反向最近邻查询算法.该算法可有效解决平面上连续移动点的反向最近邻查询.

关 键 词:时空数据库  反向最近邻查询  最近邻查询  TPR-树
文章编号:1007-2683(2007)03-0087-04
修稿时间:2006-06-05

Reverse Nearest Neighbor Query Based on TPR-tree in Spatio-temporal Databases
YU Hai-yan,HAO Zhong-xiao.Reverse Nearest Neighbor Query Based on TPR-tree in Spatio-temporal Databases[J].Journal of Harbin University of Science and Technology,2007,12(3):87-90.
Authors:YU Hai-yan  HAO Zhong-xiao
Abstract:In order to research an algorithm for solving reverse nearest neighbor query in a mobile environment,this paper uses TPR-tree index structure and proposes an algorithm for solving nearest neighbor query in a mobile environment,and proposes an algorithm for reverse nearest neighbor query.The algorithm efficiently solves reverse nearest neighbor queries for continuously moving points in the plane.
Keywords:spatio-temporal databases  reverse nearest neighbor queries  nearest neighbor queries  TPR-tree
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号