Group visible nearest neighbor queries in spatial databases

Authors:
Hu Xu;Zhicheng Li;Yansheng Lu;Ke Deng;Xiaofang Zhou
Affiliations:
School of Computer Science and Technology, Huazhong University of Science and Technology, China;School of Computer Science and Technology, Huazhong University of Science and Technology, China;School of Computer Science and Technology, Huazhong University of Science and Technology, China;School of ITEE, University of Queensland, Australia;School of ITEE, University of Queensland, Australia
Venue:
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Year:
2010

Citing 7
Cited 3

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Group Nearest Neighbor Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Continuous visible nearest neighbor queries

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous obstructed nearest neighbor queries in spatial databases

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases

IEEE Transactions on Knowledge and Data Engineering
visible nearest neighbor queries

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Nearest neighbor search on moving object trajectories

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

Continuous nearest-neighbor search in the presence of obstacles

ACM Transactions on Database Systems (TODS)
Aggregate farthest-neighbor queries over spatial data

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
On efficient obstructed reverse nearest neighbor query processing

Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Visible Nearest Neighbor Query (GVNN), which considers both visibility and distance as constraints. Multiple Traversing Obstacles (MTO) Algorithm and Traversing Obstacles Once (TOO) Algorithm are proposed to efficiently solve GVNN problem. TOO resolves GVNN by defining the invisible region of MBR of query 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.