| 基于平面线段的反向最近邻查询 |
| |
| 引用本文： | 王双峰,郝忠孝. 基于平面线段的反向最近邻查询[J]. 数字社区&智能家居, 2009, 0(11): 8621-8622,8641 |
| |
| 作者姓名： | 王双峰 郝忠孝 |
| |
| 作者单位： | [1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080 [2]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001 |
| |
| 基金项目： | 黑龙江省自然科学基金资助项目（编号：F200601） |
| |
| 摘 要： | 反向最近邻查询是空间数据库空间查询的研究热点。目前反向最近邻查询的查询粒度都是基于一维的点．在一些空间物体不能抽象为点的情况下将其抽象为点进行反向最近邻查询，查询结果不能达到一定的精度。该文在分析基于平面线段的最近邻查询和R树结构的基础上提出了一种改进的R树－Rcd树，并给出了基于Rcd树的平面线段反向最近邻查询算法．该方法能实现平面线段的反向最近邻查询。
|
| 关 键 词： | 反向最近邻 R树 Rcd树 平面线段 |
Reverse Nearest Neighbor Query Based on Line Segment |
| |
| WANG Shuang-feng,HAO Zhong-xiao. Reverse Nearest Neighbor Query Based on Line Segment[J]. Digital Community & Smart Home, 2009, 0(11): 8621-8622,8641 |
| |
| Authors: | WANG Shuang-feng HAO Zhong-xiao |
| |
| Affiliation: | 1.College of Computer Science ＆ Technology, Harbin University of Science and Technology , Harbin 150080, China;2. College of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) |
| |
| Abstract: | The reverse nearest neighbor query is becoming a hot topic in spatial query of spatial database.At present the query granularity of reverse nearest neighbor query is based on one-dimensional points, the precision of reverse nearest neighbor query for some spatial objects which can not be abstracted as points is low. In this paper we analysis the nearest neighbor query based on line segment and the structure of R_tree, and present another structure-Rcd_tree, also we present the algorithm of reverse nearest neighbor query of line segment based on this structure, this method can implement the reverse neighbor query based on line segment. |
| |
| Keywords: | reverse nearest neighbor Rtree Rcd_tree line segment |
| 本文献已被 维普 等数据库收录！ |
