摘要
有效执行空间 k近邻查询是地理信息系统尤其关心的问题 .空间近邻查询是基于空间索引的树的遍历过程 ,若测量距离和剪枝策略选取适当 ,可以极大地减少搜索空间所需访问的节点数 .基于 Rousspoulos等提出的测量距离 ,提出 2个新的近邻搜索剪枝策略 ,用于空间 k近邻查询 .给出了搜索算法 ,并用算例表明该策略具有更好的剪枝效果 ,提高了空间
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.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2001年第9期1298-1302,共5页
Journal of Shanghai Jiaotong University
