The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2010 vol.22)
pp: 1444-1458
Ken C.K. Lee , The Pennsylvania State University, University Park
Wang-Chien Lee , The Pennsylvania State University, University Park
Hong Va Leong , The Hong Kong Polytechnic University, Hong Kong
ABSTRACT
In this paper, we present a new type of spatial queries called Nearest Surrounder (NS) queries. An NS query determines the nearest polygon-shaped spatial objects (referred to as nearest surrounder objects) and their orientations with respect to a query point from an object set. Besides, we derive two NS query variants, namely, multitier NS (m-NS) queries and angle-constrained NS (ANS) queries. An m-NS query searches multiple layers of NS objects for the same range of angles from a query point. An ANS query searches for NS objects within a specified range of angles. To evaluate NS queries and their variants, we explore angle-based and distance-based bound properties of polygons, and devise two efficient algorithms, namely, Sweep and Ripple, based on R-tree. The algorithms access objects in an order according to their orientations and distances with respect to a given query point, respectively. They are efficient as they can finish a search with one index lookup. Besides, they can progressively deliver a query result. Through empirical studies, we evaluate the proposed algorithms and report their performance for both synthetic and real object sets.
INDEX TERMS
Spatial query processing, nearest surrounder queries, R-tree, algorithms.
CITATION
Ken C.K. Lee, Wang-Chien Lee, Hong Va Leong, "Nearest Surrounder Queries", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 10, pp. 1444-1458, October 2010, doi:10.1109/TKDE.2009.172
REFERENCES
[1] P.K. Agarwal and J. Matousek, "Ray Shooting and Parametric Search," Proc. ACM Symp. Theory of Computing, pp. 517-526, 1992.
[2] N. Backmann, H.-P. Kriegel, R. Schneider, and B. Seegar, "The ${\rm R}^{\ast}$ -Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322-331, May 1990.
[3] R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, "Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects," Proc. Int'l Database Eng. and Applications Symp. (IDEAS '02), pp. 44-53, July 2002.
[4] L. Downs, T. Moller, and C.H. Sequin, "Occlusion Horizons for Driving through Urban Scenery," Proc. 2001 Symp. Interactive 3D Graphics, pp. 121-124, 2001.
[5] "Environmental Systems Research Institute, Inc.," ESRI Shapefile Technical Description—An ESRI White Paper, http://www.esri. com/library/whitepapers/ pdfsshapefile.pdf, July 1998.
[6] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A.E. Abbadi, "Constrained Nearest Neighbor Queries," Proc. Seventh Int'l Symp. Advances in Spatial and Temporal Databases, pp. 257-278, July 2001.
[7] Y.J. García, M.A. Lopez, and S.T. Leutenegger, "A Greedy Algorithm for Bulk Loading R-Trees," Proc. Sixth Int'l Symp. Advances in Geographic Information Systems, pp. 163-164, Nov. 1998.
[8] A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57, June 1984.
[9] G.R. Hjaltason and H. Samet, "Distance Browsing in Spatial Databases," ACM Trans. Database Systems, vol. 24, no. 2 265-318, 1999.
[10] G.S. Iwerks, H. Samet, and K. Smith, "Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates," Proc. 29th Int'l Conf. Very Large Data Bases, pp. 512-525, Aug. 2003.
[11] F. Korn and S. Muthukrishnan, "Influence Sets Based on Reverse Nearest Neighbor Queries," Proc. 2000 ACM SIGMOD Int'l Conf. Management of Data, pp. 201-212, May 2000.
[12] K.C.K. Lee, W.-C. Lee, and H.V. Leong, "Nearest Surrounder Queries," Proc. 22nd IEEE Int'l Conf. Data Eng., p. 85, Apr. 2006.
[13] K.C.K. Lee, H.V. Leong, J. Zhou, and A. Si, "An Efficient Algorithm for Predictive Continuous Nearest Neighbor Query Processing and Result Maintenance," Proc. Sixth Int'l Conf. Mobile Data Management (MDM), pp. 178-182, May 2005.
[14] D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis, "Group Nearest Neighbor Queries," Proc. 20th Int'l Conf. Data Eng., pp. 301-312, Mar./Apr. 2004.
[15] N. Roussopoulos, S. Kelly, and F. Vincent, "Nearest Neighbor Queries," Proc. 1995 ACM SIGMOD Int'l Conf. Management of Data, pp. 71-79, May 1995.
[16] D. Salomon, Computer Graphics and Geometric Modeling. Springer-Verlag New York, Inc., 1999.
[17] T.K. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-Tree: A Dynamic Index for Multi-Dimensional Objects," Proc. 13th Int'l Conf. Very Large Data Bases, pp. 507-518, Sept. 1987.
[18] Y. Tao and D. Papadias, "Time-Parameterized Queries in Spatio-Temporal Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 334-345, June 2002.
[19] Y. Tao, D. Papadias, and Q. Shen, "Continuous Nearest Neighbor Search," Proc. 28th Int'l Conf. Very Large Data Bases, pp. 287-298, Aug. 2002.
[20] Y. Theodoridis, E. Stefanakis, and T.K. Sellis, "Efficient Cost Models for Spatial Queries Using R-Trees," IEEE Trans. Knowledge and Data Eng., vol. 12, no. 1, pp. 19-32, Jan./Feb. 2000.
[21] U.S. Census Bureau, TIGER/Line Files, http://www.census.gov/geo/www/tiger/tiger2002 tgr2002.html, 2002.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool