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

空间k近邻查询的新策略
引用本文:刘宇,朱仲英,施颂椒.空间k近邻查询的新策略[J].上海交通大学学报,2001,35(9):1298-1302.
作者姓名:刘宇  朱仲英  施颂椒
作者单位:上海交通大学自动化系,
摘    要:有效执行空间k近邻查询是地理信息系统尤其关心的问题,空间近邻查询是基于空间索引的树的遍历过程,苦测量距离和剪枝策略选取适当,可以极大地减少搜索空间所需访问的事点数,基于Rousspoulos等提出的测量距离,提出2个新的近邻搜索剪枝策略,用于空间k近邻查询,给出了搜索算法,并用算例表明该策略具有更好的剪枝效果,提高了空间k近邻查询的效率。

关 键 词:空间数据库  R树  空间k近邻查询  GIS  空间索引  近邻搜索剪技策略
文章编号:1006-2467(2001)09-1298-05
修稿时间:2000年5月15日

Novel Strategy for Spatial k-NN Query
LIU Yu,ZHU Zhong ying,SHI Song jiao.Novel Strategy for Spatial k-NN Query[J].Journal of Shanghai Jiaotong University,2001,35(9):1298-1302.
Authors:LIU Yu  ZHU Zhong ying  SHI Song jiao
Abstract:The query for spatial k nearest neighbors is especially an attractive problem in geographic information systems(GIS). The process of this kind of query is the traversal of the index tree based on spatial access method. It is believed that the number of nodes need to visit during the search can be decreased greatly by choosing the metrics and pruning strategy appropriately. According to the metrics of Rousspoulos, this paper presented two new pruning strategies for spatial k nearest neighbors query. The algorithm for query was given. And an example was performed to reveal that the method has optimal effect for search pruning and can improve the efficiency of query.
Keywords:spatial databases  R    trees  spatial  k    nearest neighbor  query
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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