Group Visible Nearest Neighbor Queries in Spatial Databases

摘要：

Traditional nearest neighbor queries and its variants, such as Group Nearest Neighbor Query (GNN), have been widely studied by many researchers. Recently obstacles are involved in spatial queries. The existence of obstacles may affect the query results due to the visibility of query point. In this paper, we propose a new type of query, Group Vis ible Nearest Neighbor Query (GVNN), which considers both visibility and distance as constraints. Multiple Traversing Obstacles (MTO) Al gorithm and Traversing Obstacles Once (TOO) Algorithm are proposed to efficiently solve CVNN problem. TOO resolves GVNN by defining the invisible region of MBR of qucry set to prune both data set and obstacle set, and traverses obstacle R*-tree only once. The experiments with different settings show that TOO is more efficient and scalable than MTO.

关键词： Croup nearest neighbor visible nearest neighbor spatial database query processing

作者: Hu Xu Zhicheng Li Yansheng Lu Ke Deng Xiaofang Zhou

作者单位: School of Computer Science and Technology, Huazhong University of Science and Technology, China School of ITEE, University of Queensland, Australia

会议类型: 国际会议

会议名称: 11th International Conference,WAIM 2010(第十一届网络时代管理国际会议)

会议地点: 九寨沟

会议语种:英文

页码: 333-344

在线出版日期: 2010-07-14（万方平台首次上网日期，不代表论文的发表时间）