计算机工程与应用2011，Vol.47Issue(34)：130-133,4.DOI:10.3778/j.issn.1002-8331.2011.34.036
空问数据库中的障碍反向最近邻查询
Obstructed reverse nearest neighbor queries in spatial databases
摘要
Abstract
Reverse Nearest Neighbor(RNN) query has been a hot subject of spatial query.In the real world, obstacles are not avoided, so the RNN query which considers the obstacle existed has become an important spatial query.The existed visible RNN only considers the visibility and does not take obstructed distance into consideration.This paper introduces a novel variant of RNN queries,the Obstructed Reverse Nearest Neighbor(ORNN) search,which finds the RNN with the shortest obstructed distance among the obstacles.By using the computation of obstructed distance and the related pruning heuristics, the ORNN query processing algorithm is proposed,and the relevant theorem and proof are given.关键词
反向最近邻/空间数据库/可视性/障碍距离Key words
Reverse Nearest Neighbor (RNN)/ spatial database/ visibility obstructed distance分类
信息技术与安全科学引用本文复制引用
杨泽雪,郝忠孝..空问数据库中的障碍反向最近邻查询[J].计算机工程与应用,2011,47(34):130-133,4.基金项目
黑龙江省教育厅2011年度科学技术研究项目(No.12511102). （No.12511102）
