时空数据库中基于TPR-树的反向最近邻查询  

Reverse Nearest Neighbor Query Based on TPR-tree in Spatio-temporal Databases

作　　者：于海彦[1] 郝忠孝[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080

出　　处：《哈尔滨理工大学学报》2007年第3期87-90,共4页Journal of Harbin University of Science and Technology

基　　金：黑龙江省自然科学基金资助项目(F00-06)

摘　　要：为研究动态环境下解决反向最近邻查询的算法,采用TPR-树索引结构给出了解决动态环境下的最近邻查询算法,并提出反向最近邻查询算法.该算法可有效解决平面上连续移动点的反向最近邻查询.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.

关 键 词：时空数据库 反向最近邻查询 最近邻查询 TPR-树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]