The Community for Technology Leaders
Subscribe
Issue No.09 - September (2009 vol.21)
pp: 1314-1327
Yunjun Gao , Singapore Management University, Singapore and Zhejiang University, Hangzhou
Baihua Zheng , Singapore Management University, Singapore
Gencai Chen , Zhejiang University, Hangzhou
Wang-Chien Lee , Pennsylvania State University, University Park
Ken C.K. Lee , Pennsylvania State University, University Park
Qing Li , City University of Hong Kong, Hong Kong
ABSTRACT
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN query retrieves the points in P that have q as their visible nearest neighbor. We propose an efficient algorithm for VRNN query processing, assuming that P and O are indexed by R-trees. Our techniques do not require any preprocessing and employ half-plane property and visibility check to prune the search space. In addition, we extend our solution to several variations of VRNN queries, including: 1) visible reverse k-nearest neighbor (VRkNN) search, which finds the points in P that have q as one of their k visible nearest neighbors; 2) \delta-VRkNN search, which handles VRkNN retrieval with the maximum visible distance \delta constraint; and 3) constrained VRkNN (CVRkNN) search, which tackles the VRkNN query with region constraint. Extensive experiments on both real and synthetic data sets have been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.
INDEX TERMS
Reverse nearest neighbor, visible reverse nearest neighbor, spatial database, query processing, algorithm.
CITATION
Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C.K. Lee, Qing Li, "Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 9, pp. 1314-1327, September 2009, doi:10.1109/TKDE.2009.113
REFERENCES
 [1] T. Asano, S.K. Ghosh, and T.C. Shermer, “Visibility in the Plane,” Handbook of Computation Geometry, J.-R. Sack and J. Urrutia, eds., pp. 829-876, Elsevier, 2000. [2] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322-331, 1990. [3] Y. Gao, B. Zheng, W.-C. Lee, and G. Chen, “Continuous Visible Nearest Neighbor Queries,” Proc. Int’l Conf. Extending Database Technology, pp. 144-155, 2009. [4] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57, 1984. [5] M. Kofler, M. Gervautz, and M. Gruber, “R-Trees for Organizing and Visualizing 3D GIS Databases,” J. Visualization and Computer Animation, vol. 11, no. 3, pp. 129-143, July 2000. [6] F. Korn and S. Muthukrishnan, “Influence Sets Based on Reverse Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 201-212, 2000. [7] F. Korn, S. Muthukrishnan, and D. Srivastava, “Reverse Nearest Neighbor Aggregates over Data Streams,” Proc. Int'l Conf. Very Large Data Bases, pp. 814-825, 2002. [8] K.C.K. Lee, B. Zheng, and W.-C. Lee, “Ranked Reverse Nearest Neighbor Search,” IEEE Trans. Knowledge and Data Eng., vol. 20, no. 7, pp. 894-910, July 2008. [9] K.-I. Lin, M. Nolen, and C. Yang, “Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems,” Proc. Int'l Database Eng. and Applications Symp., pp. 290-297, 2003. [10] S. Nutanong, E. Tanin, and R. Zhang, “Visible Nearest Neighbor Queries,” Proc. Int'l Conf. Database Systems for Advanced Applications, pp. 876-883, 2007. [11] L. Shou, C. Chionh, Y. Ruan, Z. Huang, and K.L. Tan, “Walking through a Very Large Virtual Environment in Real-Time,” Proc. Int'l Conf. Very Large Data Bases, pp. 401-410, 2001. [12] L. Shou, Z. Huang, and K.L. Tan, “HDoV-Tree: The Structure, The Storage, The Speed,” Proc. Int'l Conf. Data Eng., pp. 557-568, 2003. [13] A. Singh, H. Ferhatosmanoglu, and A. Tosun, “High Dimensional Reverse Nearest Neighbor Queries,” Proc. Conf. Information and Knowledge Management, pp. 91-98, 2003. [14] I. Stanoi, D. Agrawal, and A. El Abbadi, “Reverse Nearest Neighbor Queries for Dynamic Databases,” Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, pp. 44-53, 2000. [15] I. Stanoi, M. Riedewald, D. Agrawal, and A. El Abbadi, “Discovery of Influence Sets in Frequently Updated Databases,” Proc. Int'l Conf. Very Large Data Bases, pp. 99-108, 2001. [16] Y. Tao, D. Papadias, and X. Lian, “Reverse $k$ NN Search in Arbitrary Dimensionality,” Proc. Int'l Conf. Very Large Data Bases, pp. 744-755, 2004. [17] A.K.H. Tung, J. Hou, and J. Han, “Spatial Clustering in the Presence of Obstacles,” Proc. Int'l Conf. Data Eng., pp. 359-367, 2001. [18] C. Xia, W. Hsu, and M.-L. Lee, “ER$k$ NN: Efficient Reverse $k$ -Nearest Neighbors Retrieval with Local $k$ NN-Distance Estimation,” Proc. Conf. Information and Knowledge Management, pp. 533-540, 2005. [19] C. Yang and K.-I. Lin, “An Index Structure for Efficient Reverse Nearest Neighbor Queries,” Proc. Int'l Conf. Data Eng., pp. 485-492, 2001. [20] J. Zhang, D. Papadias, K. Mouratidis, and M. Zhu, “Spatial Queries in the Presence of Obstacles,” Proc. Int'l Conf. Extending Database Technology, pp. 366-384, 2004.