Subscribe

Issue No.05 - May (2010 vol.22)

pp: 665-681

Sarana Nutanong , The University of Melbourne, Victoria

Egemen Tanin , The University of Melbourne and NICTA Victoria Laboratory, Victoria

Rui Zhang , The University of Melbourne, Victoria

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.158

ABSTRACT

In many applications involving spatial objects, we are only interested in objects that are directly visible from query points. In this paper, we formulate the visible k nearest neighbor (VkNN) query and present incremental algorithms as a solution, with two variants differing in how to prune objects during the search process. One variant applies visibility pruning to only objects, whereas the other variant applies visibility pruning to index nodes as well. Our experimental results show that the latter outperforms the former. We further propose the aggregate VkNN query that finds the visible k nearest objects to a set of query points based on an aggregate distance function. We also propose two approaches to processing the aggregate VkNN query. One accesses the database via multiple VkNN queries, whereas the other issues an aggregate k nearest neighbor query to retrieve objects from the database and then re-rank the results based on the aggregate visible distance metric. With extensive experiments, we show that the latter approach consistently outperforms the former one.

INDEX TERMS

Geographical information systems, spatial databases, query processing.

CITATION

Sarana Nutanong, Egemen Tanin, Rui Zhang, "Incremental Evaluation of Visible Nearest Neighbor Queries",

*IEEE Transactions on Knowledge & Data Engineering*, vol.22, no. 5, pp. 665-681, May 2010, doi:10.1109/TKDE.2009.158REFERENCES

- [1] B. Aronov, L.J. Guibas, M. Teichmann, and L. Zhang, "Visibility Queries and Maintenance in Simple Polygons,"
Discrete & Computational Geometry, vol. 27, no. 4, pp. 461-483, 2002.- [2] T. Asano, T. Asano, L.J. Guibas, J. Hershberger, and H. Imai, "Visibility-Polygon Search and Euclidean Shortest Paths,"
Proc. 26th Ann. Symp. Foundations of Computer Science (FOCS), pp. 155-164, 1985.- [8] K. Engel, M. Hadwiger, C. Rezk-Salama, and J.M. Kniss,
Real-Time Volume Graphics, A K Peters Ltd., 2006.- [9] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. El Abbadi, "Constrained Nearest Neighbor Queries,"
Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), pp. 257-278, 2001.- [10] Y. Gao, B. Zheng, G. Chen, W.-C. Lee, K. Lee, and Q. Li, "Visible Reverse K-Nearest Neighbor Queries,"
Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2009.- [11] S.K. Ghosh and D.M. Mount, "An Output-Sensitive Algorithm for Computing Visibility Graphs,"
SIAM J. Computing, vol. 20, no. 5, pp. 888-910, 1991.- [12] A. Guttman, "R-trees: A Dynamic Index Structure for Spatial Searching,"
Proc. ACM SIGMOD, pp. 47-57, 1984.- [15] L. Kulik and E. Tanin, "Incremental Rank Updates for Moving Query Points,"
Proc. GIScience, pp. 251-268, 2006.- [16] K.C.K. Lee, W.C. Lee, and H.V. Leong, "Nearest Surrounder Queries,"
Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 85-94, 2006.- [18] S. Nutanong, E. Tanin, and R. Zhang, "Visible Nearest Neighbor Queries,"
Proc. Database Systems for Advanced Applications (DASFAA), pp. 876-883, 2007.- [19] S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, "The V$^{\ast}$ -Diagram: A Query Dependent Approach to Moving kNN Queries,"
Proc. 29th Int'l Conf. Very Large Data Bases (VLDB), pp. 1095-1106, 2008.- [21] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases,"
Proc. 29th Int'l Conf. Very Large Data Bases (VLDB), pp. 802-813, 2003.- [23] H. Samet, "Depth-First K-Nearest Neighbor Finding Using the MaxNearestDist Estimator,"
Proc. Int'l Conf. Image Analysis and Processing (ICIAP), pp. 486-491, 2003.- [24] H. Samet,
Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, 2006.- [25] S. Suri and J. O'Rourke, "Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes,"
Proc. Symp. Computational Geometry, pp. 14-23, 1986.- [27] A.K.H. Tung, J. Hou, and J. Han, "Spatial Clustering in the Presence of Obstacles,"
Proc. Int'l Conf. Data Eng. (ICDE), pp. 359-367, 2001.- [28] B.R. Vatti, "A Generic Solution to Polygon Clipping,"
Comm. ACM, vol. 35, no. 7 pp. 56-63, 1992.- [29] A. Zarei and M. Ghodsi, "Efficient Computation of Query Point Visibility in Polygons with Holes,"
Proc. Symp. Computational Geometry, pp. 314-320, 2005.- [30] J. Zhang, D. Papadias, K. Mouratidis, and M. Zhu, "Spatial Queries in the Presence of Obstacles,"
Proc. Ninth Int'l. Conf. Extending Database Technology (EDBT), pp. 366-384, 2004.- [31] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, "Location-Based Spatial Queries,"
Proc. ACM SIGMOD, pp. 443-454, 2003. |